TSTP Solution File: SYN009-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN009-2 : 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/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 : n025.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:08:30 EDT 2023
% Result : Unsatisfiable 2.57s 1.58s
% Output : CNFRefutation 2.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 14
% Syntax : Number of formulae : 26 ( 8 unt; 8 typ; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 41 ( 22 ~; 19 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 5 >; 8 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 24 (; 24 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ t > r > q > p > s > #nlpp > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(r,type,
r: ( $i * $i * $i ) > $o ).
tff(t,type,
t: ( $i * $i * $i ) > $o ).
tff(b,type,
b: $i ).
tff(p,type,
p: ( $i * $i * $i ) > $o ).
tff(s,type,
s: $i > $o ).
tff(q,type,
q: ( $i * $i * $i ) > $o ).
tff(c,type,
c: $i ).
tff(f_43,axiom,
t(c,c,c),
file(unknown,unknown) ).
tff(f_27,axiom,
! [X,Y,Z] :
( ~ p(X,Y,Z)
| ~ t(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [X,Y,Z] :
( ~ q(X,Y,Z)
| ~ t(Y,Z,X) ),
file(unknown,unknown) ).
tff(f_42,axiom,
s(c),
file(unknown,unknown) ).
tff(f_58,axiom,
! [X,Y,Z] :
( ~ s(X)
| ~ s(Y)
| ~ s(Z)
| p(X,Y,Z)
| q(Y,Z,X)
| r(Z,X,Y) ),
file(unknown,unknown) ).
tff(f_39,axiom,
! [X,Y,Z] :
( ~ r(X,Y,Z)
| ~ t(Z,X,Y) ),
file(unknown,unknown) ).
tff(c_14,plain,
t(c,c,c),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_22,plain,
! [X_16,Y_17,Z_18] :
( ~ t(X_16,Y_17,Z_18)
| ~ p(X_16,Y_17,Z_18) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_26,plain,
~ p(c,c,c),
inference(resolution,[status(thm)],[c_14,c_22]) ).
tff(c_17,plain,
! [Y_13,Z_14,X_15] :
( ~ t(Y_13,Z_14,X_15)
| ~ q(X_15,Y_13,Z_14) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_21,plain,
~ q(c,c,c),
inference(resolution,[status(thm)],[c_14,c_17]) ).
tff(c_12,plain,
s(c),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_16,plain,
! [Z_12,X_10,Y_11] :
( r(Z_12,X_10,Y_11)
| q(Y_11,Z_12,X_10)
| p(X_10,Y_11,Z_12)
| ~ s(Z_12)
| ~ s(Y_11)
| ~ s(X_10) ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_27,plain,
! [Z_19,X_20,Y_21] :
( ~ t(Z_19,X_20,Y_21)
| ~ r(X_20,Y_21,Z_19) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_31,plain,
~ r(c,c,c),
inference(resolution,[status(thm)],[c_14,c_27]) ).
tff(c_35,plain,
( q(c,c,c)
| p(c,c,c)
| ~ s(c) ),
inference(resolution,[status(thm)],[c_16,c_31]) ).
tff(c_38,plain,
( q(c,c,c)
| p(c,c,c) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_35]) ).
tff(c_40,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_26,c_21,c_38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN009-2 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.13 % 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.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 17:33:34 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.57/1.58 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.57/1.58
% 2.57/1.58 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.67/1.61
% 2.67/1.61 Inference rules
% 2.67/1.61 ----------------------
% 2.67/1.61 #Ref : 0
% 2.67/1.61 #Sup : 4
% 2.67/1.61 #Fact : 0
% 2.67/1.61 #Define : 0
% 2.67/1.61 #Split : 0
% 2.67/1.61 #Chain : 0
% 2.67/1.61 #Close : 0
% 2.67/1.61
% 2.67/1.61 Ordering : KBO
% 2.67/1.61
% 2.67/1.61 Simplification rules
% 2.67/1.61 ----------------------
% 2.67/1.61 #Subsume : 0
% 2.67/1.61 #Demod : 1
% 2.67/1.61 #Tautology : 0
% 2.67/1.61 #SimpNegUnit : 1
% 2.67/1.61 #BackRed : 0
% 2.67/1.61
% 2.67/1.61 #Partial instantiations: 0
% 2.67/1.61 #Strategies tried : 1
% 2.67/1.61
% 2.67/1.61 Timing (in seconds)
% 2.67/1.61 ----------------------
% 2.67/1.61 Preprocessing : 0.39
% 2.67/1.61 Parsing : 0.22
% 2.67/1.61 CNF conversion : 0.02
% 2.67/1.61 Main loop : 0.17
% 2.67/1.61 Inferencing : 0.09
% 2.67/1.61 Reduction : 0.04
% 2.67/1.61 Demodulation : 0.03
% 2.67/1.61 BG Simplification : 0.01
% 2.67/1.61 Subsumption : 0.03
% 2.67/1.61 Abstraction : 0.01
% 2.67/1.61 MUC search : 0.00
% 2.67/1.61 Cooper : 0.00
% 2.67/1.61 Total : 0.61
% 2.67/1.61 Index Insertion : 0.00
% 2.67/1.62 Index Deletion : 0.00
% 2.67/1.62 Index Matching : 0.00
% 2.67/1.62 BG Taut test : 0.00
%------------------------------------------------------------------------------