TSTP Solution File: SYN060+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN060+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 : n026.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:11 EDT 2023
% Result : Theorem 2.59s 1.63s
% Output : CNFRefutation 2.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of formulae : 16 ( 6 unt; 5 typ; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 15 ( 7 ~; 4 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ 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(f_42,axiom,
! [X] :
( ( big_g(X)
=> ~ big_i(X) )
=> ( big_f(X)
& big_h(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel30_2) ).
tff(f_45,negated_conjecture,
~ ! [X] : big_i(X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel30) ).
tff(f_33,axiom,
! [X] :
( ( big_f(X)
| big_g(X) )
=> ~ big_h(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel30_1) ).
tff(c_17,plain,
! [X_5] :
( big_i(X_5)
| big_h(X_5) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_14,plain,
~ big_i('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_21,plain,
big_h('#skF_1'),
inference(resolution,[status(thm)],[c_17,c_14]) ).
tff(c_4,plain,
! [X_1] :
( ~ big_f(X_1)
| ~ big_h(X_1) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_28,plain,
~ big_f('#skF_1'),
inference(resolution,[status(thm)],[c_21,c_4]) ).
tff(c_39,plain,
! [X_7] :
( big_i(X_7)
| big_f(X_7) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_42,plain,
big_f('#skF_1'),
inference(resolution,[status(thm)],[c_39,c_14]) ).
tff(c_46,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_28,c_42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN060+1 : TPTP v8.1.2. Released v2.0.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.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Thu Aug 3 17:47:32 EDT 2023
% 0.12/0.35 % CPUTime :
% 2.59/1.63 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.59/1.63
% 2.59/1.63 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.76/1.66
% 2.76/1.66 Inference rules
% 2.76/1.66 ----------------------
% 2.76/1.66 #Ref : 0
% 2.76/1.66 #Sup : 6
% 2.76/1.66 #Fact : 0
% 2.76/1.66 #Define : 0
% 2.76/1.66 #Split : 0
% 2.76/1.66 #Chain : 0
% 2.76/1.66 #Close : 0
% 2.76/1.66
% 2.76/1.66 Ordering : KBO
% 2.76/1.66
% 2.76/1.66 Simplification rules
% 2.76/1.66 ----------------------
% 2.76/1.66 #Subsume : 0
% 2.76/1.66 #Demod : 0
% 2.76/1.66 #Tautology : 1
% 2.76/1.66 #SimpNegUnit : 1
% 2.76/1.66 #BackRed : 0
% 2.76/1.66
% 2.76/1.66 #Partial instantiations: 0
% 2.76/1.66 #Strategies tried : 1
% 2.76/1.66
% 2.76/1.66 Timing (in seconds)
% 2.76/1.66 ----------------------
% 2.76/1.66 Preprocessing : 0.42
% 2.76/1.66 Parsing : 0.24
% 2.76/1.66 CNF conversion : 0.02
% 2.76/1.66 Main loop : 0.16
% 2.76/1.66 Inferencing : 0.09
% 2.76/1.66 Reduction : 0.02
% 2.76/1.66 Demodulation : 0.01
% 2.76/1.66 BG Simplification : 0.01
% 2.76/1.66 Subsumption : 0.03
% 2.76/1.66 Abstraction : 0.00
% 2.76/1.66 MUC search : 0.00
% 2.76/1.66 Cooper : 0.00
% 2.76/1.66 Total : 0.62
% 2.76/1.66 Index Insertion : 0.00
% 2.76/1.66 Index Deletion : 0.00
% 2.76/1.66 Index Matching : 0.00
% 2.76/1.66 BG Taut test : 0.00
%------------------------------------------------------------------------------