TSTP Solution File: SYN729+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN729+1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Aug 22 11:11:45 EDT 2023
% Result : Theorem 2.18s 1.59s
% Output : CNFRefutation 2.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 19 ( 6 unt; 6 typ; 0 def)
% Number of atoms : 27 ( 0 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 27 ( 13 ~; 6 |; 4 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 5 >; 1 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 10 (; 8 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ l > p > #nlpp > h > g > #skF_1 > #skF_2
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(p,type,
p: $i > $o ).
tff(g,type,
g: $i > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(h,type,
h: $i > $i ).
tff(l,type,
l: ( $i * $i ) > $o ).
tff(f_47,negated_conjecture,
~ ( ( ! [X] :
? [Y] :
( p(X)
=> ( l(X,g(h(Y)))
& p(Y) ) )
& ! [W] :
( p(W)
=> ( p(g(W))
& p(h(W)) ) ) )
=> ! [X] :
( p(X)
=> ? [Y] :
( l(X,Y)
& p(Y) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm72) ).
tff(c_4,plain,
p('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_10,plain,
! [X_1] :
( p('#skF_1'(X_1))
| ~ p(X_1) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_6,plain,
! [W_3] :
( p(h(W_3))
| ~ p(W_3) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_8,plain,
! [W_3] :
( p(g(W_3))
| ~ p(W_3) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_17,plain,
! [X_10] :
( l(X_10,g(h('#skF_1'(X_10))))
| ~ p(X_10) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_2,plain,
! [Y_5] :
( ~ p(Y_5)
| ~ l('#skF_2',Y_5) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_21,plain,
( ~ p(g(h('#skF_1'('#skF_2'))))
| ~ p('#skF_2') ),
inference(resolution,[status(thm)],[c_17,c_2]) ).
tff(c_24,plain,
~ p(g(h('#skF_1'('#skF_2')))),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_21]) ).
tff(c_28,plain,
~ p(h('#skF_1'('#skF_2'))),
inference(resolution,[status(thm)],[c_8,c_24]) ).
tff(c_32,plain,
~ p('#skF_1'('#skF_2')),
inference(resolution,[status(thm)],[c_6,c_28]) ).
tff(c_35,plain,
~ p('#skF_2'),
inference(resolution,[status(thm)],[c_10,c_32]) ).
tff(c_39,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN729+1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.34 % Computer : n014.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 17:04:33 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.18/1.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.18/1.59
% 2.18/1.59 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.77/1.62
% 2.77/1.62 Inference rules
% 2.77/1.62 ----------------------
% 2.77/1.62 #Ref : 0
% 2.77/1.62 #Sup : 4
% 2.77/1.62 #Fact : 0
% 2.77/1.62 #Define : 0
% 2.77/1.62 #Split : 0
% 2.77/1.62 #Chain : 0
% 2.77/1.62 #Close : 0
% 2.77/1.62
% 2.77/1.62 Ordering : KBO
% 2.77/1.62
% 2.77/1.62 Simplification rules
% 2.77/1.62 ----------------------
% 2.77/1.62 #Subsume : 0
% 2.77/1.62 #Demod : 2
% 2.77/1.62 #Tautology : 0
% 2.77/1.62 #SimpNegUnit : 0
% 2.77/1.62 #BackRed : 0
% 2.77/1.62
% 2.77/1.62 #Partial instantiations: 0
% 2.77/1.62 #Strategies tried : 1
% 2.77/1.62
% 2.77/1.62 Timing (in seconds)
% 2.77/1.62 ----------------------
% 2.77/1.62 Preprocessing : 0.41
% 2.77/1.62 Parsing : 0.23
% 2.77/1.62 CNF conversion : 0.03
% 2.77/1.62 Main loop : 0.16
% 2.77/1.62 Inferencing : 0.08
% 2.77/1.62 Reduction : 0.03
% 2.77/1.62 Demodulation : 0.02
% 2.77/1.62 BG Simplification : 0.01
% 2.77/1.62 Subsumption : 0.03
% 2.77/1.62 Abstraction : 0.00
% 2.77/1.62 MUC search : 0.00
% 2.77/1.63 Cooper : 0.00
% 2.77/1.63 Total : 0.62
% 2.77/1.63 Index Insertion : 0.00
% 2.77/1.63 Index Deletion : 0.00
% 2.77/1.63 Index Matching : 0.00
% 2.77/1.63 BG Taut test : 0.00
%------------------------------------------------------------------------------