TSTP Solution File: SYN721+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN721+1 : TPTP v8.1.2. Released v2.5.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 : n015.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:11:43 EDT 2023
% Result : Theorem 2.52s 1.67s
% Output : CNFRefutation 2.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 13 ( 5 unt; 4 typ; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 15 ( 6 ~; 3 |; 3 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 13 (; 11 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r > q > #nlpp > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(q,type,
q: ( $i * $i ) > $o ).
tff(b,type,
b: $i ).
tff(r,type,
r: ( $i * $i ) > $o ).
tff(f_43,negated_conjecture,
~ ( ( r(a,b)
& ! [X] :
( ? [Y] : r(X,Y)
=> q(X,X) )
& ! [U,V] :
( q(U,V)
=> ! [Z] : r(Z,V) ) )
=> ? [W] :
( r(b,W)
& q(W,a) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lx1) ).
tff(c_8,plain,
r(a,b),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_11,plain,
! [X_13,Y_14] :
( q(X_13,X_13)
| ~ r(X_13,Y_14) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_14,plain,
q(a,a),
inference(resolution,[status(thm)],[c_8,c_11]) ).
tff(c_4,plain,
! [Z_7,V_5,U_4] :
( r(Z_7,V_5)
| ~ q(U_4,V_5) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_18,plain,
! [Z_15] : r(Z_15,a),
inference(resolution,[status(thm)],[c_14,c_4]) ).
tff(c_2,plain,
! [W_8] :
( ~ q(W_8,a)
| ~ r(b,W_8) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_24,plain,
~ q(a,a),
inference(resolution,[status(thm)],[c_18,c_2]) ).
tff(c_29,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_14,c_24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN721+1 : TPTP v8.1.2. Released v2.5.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.16/0.36 % Computer : n015.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Thu Aug 3 17:35:14 EDT 2023
% 0.16/0.36 % CPUTime :
% 2.52/1.67 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.52/1.67
% 2.52/1.67 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.74/1.70
% 2.74/1.70 Inference rules
% 2.74/1.70 ----------------------
% 2.74/1.70 #Ref : 0
% 2.74/1.70 #Sup : 4
% 2.74/1.70 #Fact : 0
% 2.74/1.70 #Define : 0
% 2.74/1.70 #Split : 0
% 2.74/1.70 #Chain : 0
% 2.74/1.70 #Close : 0
% 2.74/1.70
% 2.74/1.70 Ordering : KBO
% 2.74/1.70
% 2.74/1.70 Simplification rules
% 2.74/1.70 ----------------------
% 2.74/1.70 #Subsume : 0
% 2.74/1.70 #Demod : 1
% 2.74/1.70 #Tautology : 0
% 2.74/1.70 #SimpNegUnit : 0
% 2.74/1.70 #BackRed : 0
% 2.74/1.70
% 2.74/1.70 #Partial instantiations: 0
% 2.74/1.70 #Strategies tried : 1
% 2.74/1.70
% 2.74/1.70 Timing (in seconds)
% 2.74/1.70 ----------------------
% 2.74/1.70 Preprocessing : 0.41
% 2.74/1.70 Parsing : 0.23
% 2.74/1.70 CNF conversion : 0.02
% 2.74/1.70 Main loop : 0.15
% 2.74/1.70 Inferencing : 0.07
% 2.74/1.70 Reduction : 0.03
% 2.74/1.70 Demodulation : 0.02
% 2.74/1.70 BG Simplification : 0.01
% 2.74/1.70 Subsumption : 0.03
% 2.74/1.70 Abstraction : 0.00
% 2.74/1.70 MUC search : 0.00
% 2.74/1.70 Cooper : 0.00
% 2.74/1.70 Total : 0.60
% 2.74/1.70 Index Insertion : 0.00
% 2.74/1.70 Index Deletion : 0.00
% 2.74/1.70 Index Matching : 0.00
% 2.74/1.70 BG Taut test : 0.00
%------------------------------------------------------------------------------