TSTP Solution File: SYN070+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN070+1 : TPTP v8.1.2. Released v2.0.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 : n006.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:09:29 EDT 2023
% Result : Theorem 2.50s 1.58s
% Output : CNFRefutation 2.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 30 ( 11 unt; 6 typ; 0 def)
% Number of atoms : 56 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 54 ( 22 ~; 18 |; 8 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 4 >; 2 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 32 (; 30 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_j > big_h > big_g > big_f > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(big_h,type,
big_h: ( $i * $i ) > $o ).
tff(big_g,type,
big_g: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(big_f,type,
big_f: $i > $o ).
tff(big_j,type,
big_j: ( $i * $i ) > $o ).
tff(f_69,negated_conjecture,
~ ! [X] :
( big_f(X)
=> big_g(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel46) ).
tff(f_36,axiom,
! [X,Y] :
( ( big_f(X)
& ( ( big_f(Y)
& big_h(Y,X) )
=> big_g(Y) ) )
=> big_g(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel46_1) ).
tff(f_64,axiom,
! [X,Y] :
( ( big_f(X)
& big_f(Y)
& big_h(X,Y) )
=> ~ big_j(Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel46_3) ).
tff(f_55,axiom,
( ? [X] :
( big_f(X)
& ~ big_g(X) )
=> ? [X1] :
( big_f(X1)
& ~ big_g(X1)
& ! [Y] :
( ( big_f(Y)
& ~ big_g(Y) )
=> big_j(X1,Y) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel46_2) ).
tff(c_18,plain,
big_f('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_2,plain,
! [Y_2,X_1] :
( ~ big_g(Y_2)
| big_g(X_1)
| ~ big_f(X_1) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_19,plain,
! [Y_2] : ~ big_g(Y_2),
inference(splitLeft,[status(thm)],[c_2]) ).
tff(c_6,plain,
! [Y_2,X_1] :
( big_f(Y_2)
| big_g(X_1)
| ~ big_f(X_1) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_21,plain,
! [Y_2,X_1] :
( big_f(Y_2)
| ~ big_f(X_1) ),
inference(negUnitSimplification,[status(thm)],[c_19,c_6]) ).
tff(c_22,plain,
! [X_1] : ~ big_f(X_1),
inference(splitLeft,[status(thm)],[c_21]) ).
tff(c_24,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_22,c_18]) ).
tff(c_25,plain,
! [Y_2] : big_f(Y_2),
inference(splitRight,[status(thm)],[c_21]) ).
tff(c_4,plain,
! [Y_2,X_1] :
( big_h(Y_2,X_1)
| big_g(X_1)
| ~ big_f(X_1) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_29,plain,
! [Y_2,X_1] :
( big_h(Y_2,X_1)
| big_g(X_1) ),
inference(demodulation,[status(thm),theory(equality)],[c_25,c_4]) ).
tff(c_30,plain,
! [Y_2,X_1] : big_h(Y_2,X_1),
inference(negUnitSimplification,[status(thm)],[c_19,c_29]) ).
tff(c_14,plain,
! [Y_7,X_6] :
( ~ big_j(Y_7,X_6)
| ~ big_h(X_6,Y_7)
| ~ big_f(Y_7)
| ~ big_f(X_6) ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_33,plain,
! [Y_7,X_6] : ~ big_j(Y_7,X_6),
inference(demodulation,[status(thm),theory(equality)],[c_25,c_25,c_30,c_14]) ).
tff(c_8,plain,
! [Y_5,X_3] :
( big_j('#skF_1',Y_5)
| big_g(Y_5)
| ~ big_f(Y_5)
| big_g(X_3)
| ~ big_f(X_3) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_36,plain,
! [Y_5,X_3] :
( big_j('#skF_1',Y_5)
| big_g(Y_5)
| big_g(X_3) ),
inference(demodulation,[status(thm),theory(equality)],[c_25,c_25,c_8]) ).
tff(c_37,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_19,c_19,c_33,c_36]) ).
tff(c_39,plain,
! [X_14] :
( big_g(X_14)
| ~ big_f(X_14) ),
inference(splitRight,[status(thm)],[c_2]) ).
tff(c_16,plain,
~ big_g('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_42,plain,
~ big_f('#skF_2'),
inference(resolution,[status(thm)],[c_39,c_16]) ).
tff(c_46,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_18,c_42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN070+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.14 % 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.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 17:15:29 EDT 2023
% 0.20/0.35 % CPUTime :
% 2.50/1.58 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.50/1.58
% 2.50/1.58 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.71/1.61
% 2.71/1.61 Inference rules
% 2.71/1.61 ----------------------
% 2.71/1.61 #Ref : 0
% 2.71/1.61 #Sup : 1
% 2.71/1.61 #Fact : 0
% 2.71/1.61 #Define : 0
% 2.71/1.61 #Split : 2
% 2.71/1.61 #Chain : 0
% 2.71/1.61 #Close : 0
% 2.71/1.61
% 2.71/1.61 Ordering : KBO
% 2.71/1.61
% 2.71/1.61 Simplification rules
% 2.71/1.61 ----------------------
% 2.71/1.61 #Subsume : 3
% 2.71/1.61 #Demod : 8
% 2.71/1.61 #Tautology : 1
% 2.71/1.61 #SimpNegUnit : 4
% 2.71/1.61 #BackRed : 1
% 2.71/1.61
% 2.71/1.61 #Partial instantiations: 0
% 2.71/1.61 #Strategies tried : 1
% 2.71/1.61
% 2.71/1.61 Timing (in seconds)
% 2.71/1.61 ----------------------
% 2.71/1.61 Preprocessing : 0.42
% 2.71/1.61 Parsing : 0.23
% 2.71/1.61 CNF conversion : 0.03
% 2.71/1.61 Main loop : 0.15
% 2.71/1.61 Inferencing : 0.06
% 2.71/1.61 Reduction : 0.03
% 2.71/1.62 Demodulation : 0.02
% 2.71/1.62 BG Simplification : 0.02
% 2.71/1.62 Subsumption : 0.03
% 2.71/1.62 Abstraction : 0.01
% 2.71/1.62 MUC search : 0.00
% 2.71/1.62 Cooper : 0.00
% 2.71/1.62 Total : 0.62
% 2.71/1.62 Index Insertion : 0.00
% 2.71/1.62 Index Deletion : 0.00
% 2.71/1.62 Index Matching : 0.00
% 2.71/1.62 BG Taut test : 0.00
%------------------------------------------------------------------------------