TSTP Solution File: SYN057+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN057+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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n023.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:10 EDT 2023
% Result : Theorem 2.71s 1.70s
% Output : CNFRefutation 2.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of formulae : 29 ( 10 unt; 7 typ; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 20 ~; 10 |; 3 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 13 (; 11 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_j > big_i > big_h > big_g > big_f > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(big_h,type,
big_h: $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_i,type,
big_i: $i > $o ).
tff(big_f,type,
big_f: $i > $o ).
tff(big_j,type,
big_j: $i > $o ).
tff(f_31,axiom,
? [X] :
( big_f(X)
& ~ big_g(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel27_1) ).
tff(f_35,axiom,
! [X] :
( big_f(X)
=> big_h(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel27_2) ).
tff(f_58,negated_conjecture,
~ ! [X] :
( big_j(X)
=> ~ big_i(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel27) ).
tff(f_41,axiom,
! [X] :
( ( big_j(X)
& big_i(X) )
=> big_f(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel27_3) ).
tff(f_52,axiom,
( ? [X] :
( big_h(X)
& ~ big_g(X) )
=> ! [X1] :
( big_i(X1)
=> ~ big_h(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel27_4) ).
tff(c_4,plain,
big_f('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_6,plain,
! [X_1] :
( big_h(X_1)
| ~ big_f(X_1) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_12,plain,
big_i('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_14,plain,
big_j('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_16,plain,
! [X_6] :
( big_f(X_6)
| ~ big_i(X_6)
| ~ big_j(X_6) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_19,plain,
( big_f('#skF_2')
| ~ big_i('#skF_2') ),
inference(resolution,[status(thm)],[c_14,c_16]) ).
tff(c_22,plain,
big_f('#skF_2'),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_19]) ).
tff(c_10,plain,
! [X1_4,X_3] :
( ~ big_h(X1_4)
| ~ big_i(X1_4)
| big_g(X_3)
| ~ big_h(X_3) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_24,plain,
! [X1_7] :
( ~ big_h(X1_7)
| ~ big_i(X1_7) ),
inference(splitLeft,[status(thm)],[c_10]) ).
tff(c_28,plain,
~ big_h('#skF_2'),
inference(resolution,[status(thm)],[c_12,c_24]) ).
tff(c_31,plain,
~ big_f('#skF_2'),
inference(resolution,[status(thm)],[c_6,c_28]) ).
tff(c_35,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_22,c_31]) ).
tff(c_37,plain,
! [X_8] :
( big_g(X_8)
| ~ big_h(X_8) ),
inference(splitRight,[status(thm)],[c_10]) ).
tff(c_42,plain,
! [X_9] :
( big_g(X_9)
| ~ big_f(X_9) ),
inference(resolution,[status(thm)],[c_6,c_37]) ).
tff(c_2,plain,
~ big_g('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_45,plain,
~ big_f('#skF_1'),
inference(resolution,[status(thm)],[c_42,c_2]) ).
tff(c_49,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : SYN057+1 : TPTP v8.1.2. Released v2.0.0.
% 0.11/0.15 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.36 % Computer : n023.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Thu Aug 3 17:42:37 EDT 2023
% 0.13/0.37 % CPUTime :
% 2.71/1.70 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.71/1.70
% 2.71/1.70 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.71/1.73
% 2.71/1.73 Inference rules
% 2.71/1.73 ----------------------
% 2.71/1.73 #Ref : 0
% 2.71/1.73 #Sup : 5
% 2.71/1.73 #Fact : 0
% 2.71/1.73 #Define : 0
% 2.71/1.73 #Split : 1
% 2.71/1.73 #Chain : 0
% 2.71/1.73 #Close : 0
% 2.71/1.73
% 2.71/1.73 Ordering : KBO
% 2.71/1.73
% 2.71/1.73 Simplification rules
% 2.71/1.73 ----------------------
% 2.71/1.73 #Subsume : 0
% 2.71/1.73 #Demod : 3
% 2.71/1.73 #Tautology : 0
% 2.71/1.73 #SimpNegUnit : 0
% 2.71/1.73 #BackRed : 0
% 2.71/1.73
% 2.71/1.73 #Partial instantiations: 0
% 2.71/1.73 #Strategies tried : 1
% 2.71/1.73
% 2.71/1.73 Timing (in seconds)
% 2.71/1.73 ----------------------
% 2.71/1.73 Preprocessing : 0.40
% 2.71/1.73 Parsing : 0.23
% 2.71/1.73 CNF conversion : 0.02
% 2.71/1.73 Main loop : 0.17
% 2.71/1.73 Inferencing : 0.08
% 2.71/1.73 Reduction : 0.03
% 2.71/1.73 Demodulation : 0.02
% 2.71/1.73 BG Simplification : 0.01
% 2.71/1.73 Subsumption : 0.03
% 2.71/1.73 Abstraction : 0.00
% 2.71/1.73 MUC search : 0.00
% 2.71/1.73 Cooper : 0.00
% 2.71/1.73 Total : 0.62
% 2.71/1.73 Index Insertion : 0.00
% 2.71/1.73 Index Deletion : 0.00
% 2.71/1.73 Index Matching : 0.00
% 2.71/1.73 BG Taut test : 0.00
%------------------------------------------------------------------------------