TSTP Solution File: SYN359+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN359+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 : n005.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.78s 1.72s
% Output : CNFRefutation 2.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 12 ( 3 unt; 4 typ; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 17 ( 7 ~; 4 |; 3 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 14 (; 10 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_q > big_r > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(big_r,type,
big_r: $i > $o ).
tff(big_q,type,
big_q: ( $i * $i ) > $o ).
tff(f_44,negated_conjecture,
~ ( ( ? [X] : big_r(X)
& ! [Y] :
( big_r(Y)
=> ? [Z] : big_q(Y,Z) )
& ! [X,Y] :
( big_q(X,Y)
=> big_q(X,X) ) )
=> ? [X,Y] :
( big_q(X,Y)
& big_r(Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2110) ).
tff(c_11,plain,
! [Y_11] :
( big_q(Y_11,'#skF_2'(Y_11))
| ~ big_r(Y_11) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_4,plain,
! [X_3,Y_4] :
( big_q(X_3,X_3)
| ~ big_q(X_3,Y_4) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_19,plain,
! [Y_12] :
( big_q(Y_12,Y_12)
| ~ big_r(Y_12) ),
inference(resolution,[status(thm)],[c_11,c_4]) ).
tff(c_2,plain,
! [Y_6,X_5] :
( ~ big_r(Y_6)
| ~ big_q(X_5,Y_6) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_26,plain,
! [Y_12] : ~ big_r(Y_12),
inference(resolution,[status(thm)],[c_19,c_2]) ).
tff(c_8,plain,
big_r('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_29,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_26,c_8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN359+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.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:09:27 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.78/1.72 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.78/1.72
% 2.78/1.72 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.78/1.75
% 2.78/1.75 Inference rules
% 2.78/1.75 ----------------------
% 2.78/1.75 #Ref : 0
% 2.78/1.75 #Sup : 4
% 2.78/1.75 #Fact : 0
% 2.78/1.75 #Define : 0
% 2.78/1.75 #Split : 0
% 2.78/1.75 #Chain : 0
% 2.78/1.75 #Close : 0
% 2.78/1.75
% 2.78/1.75 Ordering : KBO
% 2.78/1.75
% 2.78/1.75 Simplification rules
% 2.78/1.75 ----------------------
% 2.78/1.75 #Subsume : 5
% 2.78/1.75 #Demod : 0
% 2.78/1.75 #Tautology : 0
% 2.78/1.75 #SimpNegUnit : 1
% 2.78/1.75 #BackRed : 1
% 2.78/1.75
% 2.78/1.75 #Partial instantiations: 0
% 2.78/1.75 #Strategies tried : 1
% 2.78/1.75
% 2.78/1.75 Timing (in seconds)
% 2.78/1.75 ----------------------
% 2.78/1.75 Preprocessing : 0.50
% 2.78/1.75 Parsing : 0.28
% 2.78/1.75 CNF conversion : 0.03
% 2.78/1.75 Main loop : 0.17
% 2.78/1.75 Inferencing : 0.08
% 2.78/1.75 Reduction : 0.03
% 2.78/1.75 Demodulation : 0.02
% 2.78/1.75 BG Simplification : 0.01
% 2.78/1.75 Subsumption : 0.04
% 2.78/1.75 Abstraction : 0.00
% 2.78/1.75 MUC search : 0.00
% 2.78/1.75 Cooper : 0.00
% 2.78/1.75 Total : 0.71
% 2.78/1.75 Index Insertion : 0.00
% 2.78/1.75 Index Deletion : 0.00
% 2.78/1.75 Index Matching : 0.00
% 2.78/1.75 BG Taut test : 0.00
%------------------------------------------------------------------------------