TSTP Solution File: SYN009-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN009-4 : 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 : n009.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:31 EDT 2023
% Result : Unsatisfiable 2.62s 1.65s
% Output : CNFRefutation 2.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of formulae : 30 ( 7 unt; 9 typ; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 77 ( 40 ~; 37 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 6 >; 10 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 39 (; 39 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r > q > p > n > m > 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(n,type,
n: ( $i * $i * $i ) > $o ).
tff(b,type,
b: $i ).
tff(m,type,
m: ( $i * $i * $i ) > $o ).
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_42,axiom,
s(c),
file(unknown,unknown) ).
tff(f_72,axiom,
! [X,Y,Z] :
( ~ s(X)
| ~ s(Y)
| ~ s(Z)
| m(X,Y,Z)
| n(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_44,axiom,
~ n(c,c,c),
file(unknown,unknown) ).
tff(f_59,axiom,
! [X,Y,Z] :
( ~ s(X)
| ~ s(Y)
| ~ s(Z)
| p(X,Y,Z)
| q(X,Y,Z)
| r(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_39,axiom,
! [X,Y,Z] :
( ~ r(X,Y,Z)
| ~ m(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [X,Y,Z] :
( ~ q(X,Y,Z)
| ~ m(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_27,axiom,
! [X,Y,Z] :
( ~ p(X,Y,Z)
| ~ m(X,Y,Z) ),
file(unknown,unknown) ).
tff(c_12,plain,
s(c),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_22,plain,
! [X_25,Y_26,Z_27] :
( n(X_25,Y_26,Z_27)
| m(X_25,Y_26,Z_27)
| ~ s(Z_27)
| ~ s(Y_26)
| ~ s(X_25) ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_14,plain,
~ n(c,c,c),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_25,plain,
( m(c,c,c)
| ~ s(c) ),
inference(resolution,[status(thm)],[c_22,c_14]) ).
tff(c_28,plain,
m(c,c,c),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_25]) ).
tff(c_29,plain,
! [X_28,Y_29,Z_30] :
( r(X_28,Y_29,Z_30)
| q(X_28,Y_29,Z_30)
| p(X_28,Y_29,Z_30)
| ~ s(Z_30)
| ~ s(Y_29)
| ~ s(X_28) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_6,plain,
! [X_7,Y_8,Z_9] :
( ~ m(X_7,Y_8,Z_9)
| ~ r(X_7,Y_8,Z_9) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_34,plain,
! [X_31,Y_32,Z_33] :
( ~ m(X_31,Y_32,Z_33)
| q(X_31,Y_32,Z_33)
| p(X_31,Y_32,Z_33)
| ~ s(Z_33)
| ~ s(Y_32)
| ~ s(X_31) ),
inference(resolution,[status(thm)],[c_29,c_6]) ).
tff(c_4,plain,
! [X_4,Y_5,Z_6] :
( ~ m(X_4,Y_5,Z_6)
| ~ q(X_4,Y_5,Z_6) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_39,plain,
! [X_34,Y_35,Z_36] :
( ~ m(X_34,Y_35,Z_36)
| p(X_34,Y_35,Z_36)
| ~ s(Z_36)
| ~ s(Y_35)
| ~ s(X_34) ),
inference(resolution,[status(thm)],[c_34,c_4]) ).
tff(c_2,plain,
! [X_1,Y_2,Z_3] :
( ~ m(X_1,Y_2,Z_3)
| ~ p(X_1,Y_2,Z_3) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_44,plain,
! [X_37,Y_38,Z_39] :
( ~ m(X_37,Y_38,Z_39)
| ~ s(Z_39)
| ~ s(Y_38)
| ~ s(X_37) ),
inference(resolution,[status(thm)],[c_39,c_2]) ).
tff(c_47,plain,
~ s(c),
inference(resolution,[status(thm)],[c_28,c_44]) ).
tff(c_51,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_12,c_47]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN009-4 : 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.14/0.34 % Computer : n009.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:29:38 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.62/1.65 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.62/1.66
% 2.62/1.66 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.62/1.68
% 2.62/1.68 Inference rules
% 2.62/1.68 ----------------------
% 2.62/1.68 #Ref : 0
% 2.62/1.68 #Sup : 5
% 2.62/1.69 #Fact : 0
% 2.62/1.69 #Define : 0
% 2.62/1.69 #Split : 0
% 2.62/1.69 #Chain : 0
% 2.62/1.69 #Close : 0
% 2.93/1.69
% 2.93/1.69 Ordering : KBO
% 2.93/1.69
% 2.93/1.69 Simplification rules
% 2.93/1.69 ----------------------
% 2.93/1.69 #Subsume : 2
% 2.93/1.69 #Demod : 2
% 2.93/1.69 #Tautology : 0
% 2.93/1.69 #SimpNegUnit : 0
% 2.93/1.69 #BackRed : 0
% 2.93/1.69
% 2.93/1.69 #Partial instantiations: 0
% 2.93/1.69 #Strategies tried : 1
% 2.93/1.69
% 2.93/1.69 Timing (in seconds)
% 2.93/1.69 ----------------------
% 2.93/1.69 Preprocessing : 0.40
% 2.93/1.69 Parsing : 0.22
% 2.93/1.69 CNF conversion : 0.02
% 2.93/1.69 Main loop : 0.21
% 2.93/1.69 Inferencing : 0.11
% 2.93/1.69 Reduction : 0.04
% 2.93/1.69 Demodulation : 0.03
% 2.93/1.69 BG Simplification : 0.01
% 2.93/1.69 Subsumption : 0.04
% 2.93/1.69 Abstraction : 0.01
% 2.93/1.69 MUC search : 0.00
% 2.93/1.69 Cooper : 0.00
% 2.93/1.69 Total : 0.66
% 2.93/1.69 Index Insertion : 0.00
% 2.93/1.69 Index Deletion : 0.00
% 2.93/1.69 Index Matching : 0.00
% 2.93/1.69 BG Taut test : 0.00
%------------------------------------------------------------------------------