TSTP Solution File: SYN058+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN058+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 : n012.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.27s 1.62s
% Output : CNFRefutation 2.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of formulae : 30 ( 13 unt; 9 typ; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 24 ( 11 ~; 6 |; 2 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 15 (; 13 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_s > big_r > big_q > big_p > big_g > big_f > #nlpp > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(big_s,type,
big_s: $i > $o ).
tff(big_q,type,
big_q: $i > $o ).
tff(big_g,type,
big_g: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(big_p,type,
big_p: $i > $o ).
tff(big_f,type,
big_f: $i > $o ).
tff(big_r,type,
big_r: $i > $o ).
tff(f_55,negated_conjecture,
~ ! [X] :
( ( big_p(X)
& big_f(X) )
=> big_g(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel28) ).
tff(f_48,axiom,
( ? [X] : big_s(X)
=> ! [X1] :
( big_f(X1)
=> big_g(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel28_3) ).
tff(f_32,axiom,
! [X] :
( big_p(X)
=> ! [Z] : big_q(Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel28_1) ).
tff(f_41,axiom,
( ! [X] :
( big_q(X)
| big_r(X) )
=> ? [X1] :
( big_q(X1)
& big_s(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel28_2) ).
tff(c_16,plain,
big_f('#skF_3'),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_12,plain,
! [X1_5,X_4] :
( big_g(X1_5)
| ~ big_f(X1_5)
| ~ big_s(X_4) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_40,plain,
! [X_4] : ~ big_s(X_4),
inference(splitLeft,[status(thm)],[c_12]) ).
tff(c_2,plain,
! [Z_3,X_1] :
( big_q(Z_3)
| ~ big_p(X_1) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_21,plain,
! [X_1] : ~ big_p(X_1),
inference(splitLeft,[status(thm)],[c_2]) ).
tff(c_18,plain,
big_p('#skF_3'),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_23,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_21,c_18]) ).
tff(c_24,plain,
! [Z_3] : big_q(Z_3),
inference(splitRight,[status(thm)],[c_2]) ).
tff(c_6,plain,
( ~ big_q('#skF_1')
| big_s('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_19,plain,
~ big_q('#skF_1'),
inference(splitLeft,[status(thm)],[c_6]) ).
tff(c_27,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_24,c_19]) ).
tff(c_28,plain,
big_s('#skF_2'),
inference(splitRight,[status(thm)],[c_6]) ).
tff(c_42,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_40,c_28]) ).
tff(c_44,plain,
! [X1_7] :
( big_g(X1_7)
| ~ big_f(X1_7) ),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_14,plain,
~ big_g('#skF_3'),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_47,plain,
~ big_f('#skF_3'),
inference(resolution,[status(thm)],[c_44,c_14]) ).
tff(c_51,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_47]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN058+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.14/0.36 % Computer : n012.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:25:07 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.27/1.62 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.27/1.63
% 2.27/1.63 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.27/1.65
% 2.27/1.65 Inference rules
% 2.27/1.65 ----------------------
% 2.27/1.65 #Ref : 0
% 2.27/1.65 #Sup : 1
% 2.27/1.65 #Fact : 0
% 2.27/1.65 #Define : 0
% 2.27/1.65 #Split : 6
% 2.27/1.65 #Chain : 0
% 2.27/1.65 #Close : 0
% 2.27/1.65
% 2.27/1.65 Ordering : KBO
% 2.27/1.65
% 2.27/1.65 Simplification rules
% 2.27/1.65 ----------------------
% 2.27/1.65 #Subsume : 3
% 2.27/1.65 #Demod : 6
% 2.27/1.65 #Tautology : 2
% 2.27/1.65 #SimpNegUnit : 3
% 2.27/1.65 #BackRed : 4
% 2.27/1.65
% 2.27/1.65 #Partial instantiations: 0
% 2.27/1.65 #Strategies tried : 1
% 2.27/1.65
% 2.27/1.65 Timing (in seconds)
% 2.27/1.65 ----------------------
% 2.27/1.66 Preprocessing : 0.40
% 2.27/1.66 Parsing : 0.23
% 2.27/1.66 CNF conversion : 0.03
% 2.27/1.66 Main loop : 0.18
% 2.27/1.66 Inferencing : 0.07
% 2.27/1.66 Reduction : 0.04
% 2.27/1.66 Demodulation : 0.03
% 2.27/1.66 BG Simplification : 0.01
% 2.27/1.66 Subsumption : 0.04
% 2.27/1.66 Abstraction : 0.01
% 2.27/1.66 MUC search : 0.00
% 2.27/1.66 Cooper : 0.00
% 2.27/1.66 Total : 0.63
% 2.27/1.66 Index Insertion : 0.00
% 2.27/1.66 Index Deletion : 0.00
% 2.27/1.66 Index Matching : 0.00
% 2.27/1.66 BG Taut test : 0.00
%------------------------------------------------------------------------------