TSTP Solution File: SYN361+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN361+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 : n003.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:10:37 EDT 2023
% Result : Theorem 2.41s 1.49s
% Output : CNFRefutation 2.51s
% 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 : 15 ( 0 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 14 ( 7 ~; 2 |; 2 &)
% ( 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 ( 4 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 14 (; 11 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_q > big_p > big_s > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff(big_p,type,
big_p: ( $i * $i ) > $o ).
tff(big_s,type,
big_s: $i > $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(big_q,type,
big_q: ( $i * $i ) > $o ).
tff(f_45,negated_conjecture,
~ ( ( ? [V] :
! [X] : big_p(X,V)
& ! [X] :
( big_s(X)
=> ? [Y] : big_q(Y,X) )
& ! [X,Y] :
( big_p(X,Y)
=> ~ big_q(X,Y) ) )
=> ? [U] : ~ big_s(U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2112) ).
tff(c_8,plain,
! [X_2] : big_p(X_2,'#skF_1'),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_2,plain,
! [U_7] : big_s(U_7),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_6,plain,
! [X_3] :
( big_q('#skF_2'(X_3),X_3)
| ~ big_s(X_3) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_10,plain,
! [X_3] : big_q('#skF_2'(X_3),X_3),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_6]) ).
tff(c_14,plain,
! [X_11,Y_12] :
( ~ big_q(X_11,Y_12)
| ~ big_p(X_11,Y_12) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_19,plain,
! [X_13] : ~ big_p('#skF_2'(X_13),X_13),
inference(resolution,[status(thm)],[c_10,c_14]) ).
tff(c_24,plain,
$false,
inference(resolution,[status(thm)],[c_8,c_19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN361+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.12 % 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.33 % Computer : n003.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.33 % CPULimit : 300
% 0.19/0.33 % WCLimit : 300
% 0.19/0.33 % DateTime : Thu Aug 3 17:30:38 EDT 2023
% 0.19/0.33 % CPUTime :
% 2.41/1.49 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.41/1.49
% 2.41/1.49 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.51/1.52
% 2.51/1.52 Inference rules
% 2.51/1.52 ----------------------
% 2.51/1.52 #Ref : 0
% 2.51/1.52 #Sup : 2
% 2.51/1.52 #Fact : 0
% 2.51/1.52 #Define : 0
% 2.51/1.52 #Split : 0
% 2.51/1.52 #Chain : 0
% 2.51/1.52 #Close : 0
% 2.51/1.52
% 2.51/1.52 Ordering : KBO
% 2.51/1.52
% 2.51/1.52 Simplification rules
% 2.51/1.52 ----------------------
% 2.51/1.52 #Subsume : 0
% 2.51/1.52 #Demod : 1
% 2.51/1.52 #Tautology : 0
% 2.51/1.52 #SimpNegUnit : 0
% 2.51/1.52 #BackRed : 0
% 2.51/1.52
% 2.51/1.52 #Partial instantiations: 0
% 2.51/1.52 #Strategies tried : 1
% 2.51/1.52
% 2.51/1.52 Timing (in seconds)
% 2.51/1.52 ----------------------
% 2.51/1.52 Preprocessing : 0.37
% 2.51/1.52 Parsing : 0.21
% 2.51/1.52 CNF conversion : 0.02
% 2.51/1.52 Main loop : 0.13
% 2.51/1.52 Inferencing : 0.06
% 2.51/1.52 Reduction : 0.02
% 2.51/1.52 Demodulation : 0.02
% 2.51/1.52 BG Simplification : 0.01
% 2.51/1.52 Subsumption : 0.02
% 2.51/1.52 Abstraction : 0.00
% 2.51/1.52 MUC search : 0.00
% 2.51/1.52 Cooper : 0.00
% 2.51/1.52 Total : 0.54
% 2.51/1.52 Index Insertion : 0.00
% 2.51/1.52 Index Deletion : 0.00
% 2.51/1.52 Index Matching : 0.00
% 2.51/1.52 BG Taut test : 0.00
%------------------------------------------------------------------------------