TSTP Solution File: SYN061+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN061+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 : n031.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:12 EDT 2023
% Result : Theorem 2.56s 1.60s
% Output : CNFRefutation 2.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of formulae : 19 ( 5 unt; 6 typ; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 9 ~; 5 |; 3 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 8 (; 5 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_j > big_i > big_h > big_g > big_f > #nlpp > #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_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_37,axiom,
? [X] :
( big_i(X)
& big_f(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel31_2) ).
tff(f_42,axiom,
! [X] :
( ~ big_h(X)
=> big_j(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel31_3) ).
tff(f_47,negated_conjecture,
~ ? [X] :
( big_i(X)
& big_j(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel31) ).
tff(f_33,axiom,
~ ? [X] :
( big_f(X)
& ( big_g(X)
| big_h(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel31_1) ).
tff(c_6,plain,
big_f('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_8,plain,
big_i('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_10,plain,
! [X_2] :
( big_j(X_2)
| big_h(X_2) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_15,plain,
! [X_6] :
( ~ big_j(X_6)
| ~ big_i(X_6) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_21,plain,
! [X_8] :
( ~ big_i(X_8)
| big_h(X_8) ),
inference(resolution,[status(thm)],[c_10,c_15]) ).
tff(c_25,plain,
big_h('#skF_1'),
inference(resolution,[status(thm)],[c_8,c_21]) ).
tff(c_2,plain,
! [X_1] :
( ~ big_h(X_1)
| ~ big_f(X_1) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_28,plain,
~ big_f('#skF_1'),
inference(resolution,[status(thm)],[c_25,c_2]) ).
tff(c_32,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SYN061+1 : TPTP v8.1.2. Released v2.0.0.
% 0.13/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.14/0.36 % Computer : n031.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 17:40:59 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.56/1.60 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.56/1.60
% 2.56/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.73/1.63
% 2.73/1.63 Inference rules
% 2.73/1.63 ----------------------
% 2.73/1.63 #Ref : 0
% 2.73/1.63 #Sup : 3
% 2.73/1.63 #Fact : 0
% 2.73/1.63 #Define : 0
% 2.73/1.63 #Split : 0
% 2.73/1.63 #Chain : 0
% 2.73/1.63 #Close : 0
% 2.73/1.63
% 2.73/1.63 Ordering : KBO
% 2.73/1.63
% 2.73/1.63 Simplification rules
% 2.73/1.63 ----------------------
% 2.73/1.63 #Subsume : 0
% 2.73/1.63 #Demod : 1
% 2.73/1.63 #Tautology : 0
% 2.73/1.63 #SimpNegUnit : 0
% 2.73/1.63 #BackRed : 0
% 2.73/1.63
% 2.73/1.63 #Partial instantiations: 0
% 2.73/1.63 #Strategies tried : 1
% 2.73/1.63
% 2.73/1.63 Timing (in seconds)
% 2.73/1.63 ----------------------
% 2.73/1.63 Preprocessing : 0.41
% 2.73/1.63 Parsing : 0.23
% 2.73/1.63 CNF conversion : 0.02
% 2.73/1.63 Main loop : 0.16
% 2.73/1.63 Inferencing : 0.09
% 2.73/1.63 Reduction : 0.03
% 2.73/1.63 Demodulation : 0.02
% 2.73/1.63 BG Simplification : 0.01
% 2.73/1.63 Subsumption : 0.03
% 2.73/1.63 Abstraction : 0.00
% 2.73/1.63 MUC search : 0.00
% 2.73/1.63 Cooper : 0.00
% 2.73/1.63 Total : 0.61
% 2.73/1.63 Index Insertion : 0.00
% 2.73/1.63 Index Deletion : 0.00
% 2.73/1.63 Index Matching : 0.00
% 2.73/1.63 BG Taut test : 0.00
%------------------------------------------------------------------------------