TSTP Solution File: SYN050+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN050+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 : n029.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:08 EDT 2023
% Result : Theorem 2.03s 1.52s
% Output : CNFRefutation 2.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 13 ( 5 unt; 5 typ; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 16 ( 7 ~; 3 |; 3 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 5 >; 1 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 15 (; 11 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_s > big_r > big_q > big_p > #nlpp > #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_p,type,
big_p: $i > $o ).
tff(big_r,type,
big_r: $i > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_44,negated_conjecture,
~ ( ! [X,Y] :
? [Z] :
! [W] :
( ( big_p(X)
& big_q(Y) )
=> ( big_r(Z)
& big_s(W) ) )
=> ? [X1,Y1] :
( ( big_p(X1)
& big_q(Y1) )
=> ? [Z1] : big_r(Z1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel20) ).
tff(c_4,plain,
! [Y1_9] : big_q(Y1_9),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_6,plain,
! [Z1_11] : ~ big_r(Z1_11),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_10,plain,
! [X_1,Y_2] :
( big_r('#skF_1'(X_1,Y_2))
| ~ big_q(Y_2)
| ~ big_p(X_1) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_11,plain,
! [Y_2,X_1] :
( ~ big_q(Y_2)
| ~ big_p(X_1) ),
inference(negUnitSimplification,[status(thm)],[c_6,c_10]) ).
tff(c_13,plain,
! [X_1] : ~ big_p(X_1),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_11]) ).
tff(c_2,plain,
! [X1_8] : big_p(X1_8),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_14,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_13,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN050+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.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 17:42:07 EDT 2023
% 0.14/0.34 % CPUTime :
% 2.03/1.52 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.03/1.52
% 2.03/1.52 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.03/1.56
% 2.03/1.56 Inference rules
% 2.03/1.56 ----------------------
% 2.03/1.56 #Ref : 0
% 2.03/1.56 #Sup : 0
% 2.03/1.56 #Fact : 0
% 2.03/1.56 #Define : 0
% 2.03/1.56 #Split : 0
% 2.03/1.56 #Chain : 0
% 2.03/1.56 #Close : 0
% 2.03/1.56
% 2.03/1.56 Ordering : KBO
% 2.03/1.56
% 2.03/1.56 Simplification rules
% 2.03/1.56 ----------------------
% 2.03/1.56 #Subsume : 4
% 2.03/1.56 #Demod : 1
% 2.03/1.56 #Tautology : 0
% 2.03/1.56 #SimpNegUnit : 2
% 2.03/1.56 #BackRed : 0
% 2.03/1.56
% 2.03/1.56 #Partial instantiations: 0
% 2.03/1.56 #Strategies tried : 1
% 2.03/1.56
% 2.03/1.56 Timing (in seconds)
% 2.03/1.56 ----------------------
% 2.03/1.57 Preprocessing : 0.39
% 2.03/1.57 Parsing : 0.22
% 2.03/1.57 CNF conversion : 0.03
% 2.03/1.57 Main loop : 0.06
% 2.03/1.57 Inferencing : 0.00
% 2.03/1.57 Reduction : 0.02
% 2.03/1.57 Demodulation : 0.02
% 2.03/1.57 BG Simplification : 0.01
% 2.03/1.57 Subsumption : 0.03
% 2.03/1.57 Abstraction : 0.00
% 2.03/1.57 MUC search : 0.00
% 2.03/1.57 Cooper : 0.00
% 2.03/1.57 Total : 0.51
% 2.03/1.57 Index Insertion : 0.00
% 2.03/1.57 Index Deletion : 0.00
% 2.03/1.57 Index Matching : 0.00
% 2.03/1.57 BG Taut test : 0.00
%------------------------------------------------------------------------------