TSTP Solution File: SYN312-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN312-1 : TPTP v8.1.2. Bugfixed 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 : n019.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:23 EDT 2023
% Result : Unsatisfiable 3.08s 1.89s
% Output : CNFRefutation 3.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of formulae : 36 ( 15 unt; 7 typ; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 40 ( 24 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 3 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 42 (; 42 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > #nlpp > g > f > d > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(f,type,
f: $i > $i ).
tff(g,type,
g: $i > $i ).
tff(b,type,
b: $i ).
tff(d,type,
d: $i ).
tff(p,type,
p: ( $i * $i * $i ) > $o ).
tff(c,type,
c: $i ).
tff(f_50,axiom,
! [X,X1,X2] :
( p(g(X),X1,X2)
| ~ p(X,X1,X2) ),
file(unknown,unknown) ).
tff(f_35,axiom,
! [X2,X1,X] :
( p(X2,X1,X)
| ~ p(X,X1,X2) ),
file(unknown,unknown) ).
tff(f_45,axiom,
! [X,X1,X2] :
( p(X,X1,f(X2))
| ~ p(X,X1,X2) ),
file(unknown,unknown) ).
tff(f_40,axiom,
! [X1,X,X2] :
( p(X1,X,X2)
| ~ p(X,X1,X2) ),
file(unknown,unknown) ).
tff(f_54,axiom,
~ p(f(g(a)),f(g(d)),f(g(c))),
file(unknown,unknown) ).
tff(f_51,axiom,
p(a,f(b),c),
file(unknown,unknown) ).
tff(f_52,axiom,
p(f(b),d,c),
file(unknown,unknown) ).
tff(f_30,axiom,
! [X,X3,X2,X1] :
( p(X,X3,X2)
| ~ p(X,X1,X2)
| ~ p(X1,X3,X2) ),
file(unknown,unknown) ).
tff(c_110,plain,
! [X_26,X1_27,X2_28] :
( ~ p(X_26,X1_27,X2_28)
| p(g(X_26),X1_27,X2_28) ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_4,plain,
! [X_7,X1_6,X2_5] :
( ~ p(X_7,X1_6,X2_5)
| p(X2_5,X1_6,X_7) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_116,plain,
! [X2_28,X1_27,X_26] :
( p(X2_28,X1_27,g(X_26))
| ~ p(X_26,X1_27,X2_28) ),
inference(resolution,[status(thm)],[c_110,c_4]) ).
tff(c_66,plain,
! [X_23,X1_24,X2_25] :
( ~ p(X_23,X1_24,X2_25)
| p(X_23,X1_24,f(X2_25)) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_6,plain,
! [X_9,X1_8,X2_10] :
( ~ p(X_9,X1_8,X2_10)
| p(X1_8,X_9,X2_10) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_71,plain,
! [X1_24,X_23,X2_25] :
( p(X1_24,X_23,f(X2_25))
| ~ p(X_23,X1_24,X2_25) ),
inference(resolution,[status(thm)],[c_66,c_6]) ).
tff(c_8,plain,
! [X_11,X1_12,X2_13] :
( ~ p(X_11,X1_12,X2_13)
| p(X_11,X1_12,f(X2_13)) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_16,plain,
~ p(f(g(a)),f(g(d)),f(g(c))),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_129,plain,
~ p(f(g(a)),f(g(d)),g(c)),
inference(resolution,[status(thm)],[c_8,c_16]) ).
tff(c_165,plain,
~ p(c,f(g(d)),f(g(a))),
inference(resolution,[status(thm)],[c_116,c_129]) ).
tff(c_173,plain,
~ p(f(g(d)),c,g(a)),
inference(resolution,[status(thm)],[c_71,c_165]) ).
tff(c_236,plain,
~ p(a,c,f(g(d))),
inference(resolution,[status(thm)],[c_116,c_173]) ).
tff(c_244,plain,
~ p(c,a,g(d)),
inference(resolution,[status(thm)],[c_71,c_236]) ).
tff(c_249,plain,
~ p(d,a,c),
inference(resolution,[status(thm)],[c_116,c_244]) ).
tff(c_12,plain,
p(a,f(b),c),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_14,plain,
p(f(b),d,c),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_175,plain,
! [X1_41,X3_42,X2_43,X_44] :
( ~ p(X1_41,X3_42,X2_43)
| ~ p(X_44,X1_41,X2_43)
| p(X_44,X3_42,X2_43) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_266,plain,
! [X_45] :
( ~ p(X_45,f(b),c)
| p(X_45,d,c) ),
inference(resolution,[status(thm)],[c_14,c_175]) ).
tff(c_284,plain,
p(a,d,c),
inference(resolution,[status(thm)],[c_12,c_266]) ).
tff(c_298,plain,
p(d,a,c),
inference(resolution,[status(thm)],[c_284,c_6]) ).
tff(c_305,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_249,c_298]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN312-1 : TPTP v8.1.2. Bugfixed v2.0.0.
% 0.00/0.14 % 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.17/0.35 % Computer : n019.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu Aug 3 17:09:46 EDT 2023
% 0.17/0.36 % CPUTime :
% 3.08/1.89 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.08/1.90
% 3.08/1.90 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.37/1.94
% 3.37/1.94 Inference rules
% 3.37/1.94 ----------------------
% 3.37/1.94 #Ref : 0
% 3.37/1.94 #Sup : 80
% 3.37/1.94 #Fact : 0
% 3.37/1.94 #Define : 0
% 3.37/1.94 #Split : 0
% 3.37/1.94 #Chain : 0
% 3.37/1.94 #Close : 0
% 3.37/1.94
% 3.37/1.94 Ordering : KBO
% 3.37/1.94
% 3.37/1.94 Simplification rules
% 3.37/1.94 ----------------------
% 3.37/1.94 #Subsume : 5
% 3.37/1.94 #Demod : 15
% 3.37/1.94 #Tautology : 16
% 3.37/1.94 #SimpNegUnit : 1
% 3.37/1.94 #BackRed : 0
% 3.37/1.94
% 3.37/1.94 #Partial instantiations: 0
% 3.37/1.94 #Strategies tried : 1
% 3.37/1.94
% 3.37/1.94 Timing (in seconds)
% 3.37/1.94 ----------------------
% 3.37/1.94 Preprocessing : 0.41
% 3.37/1.94 Parsing : 0.23
% 3.37/1.94 CNF conversion : 0.02
% 3.37/1.94 Main loop : 0.38
% 3.37/1.94 Inferencing : 0.15
% 3.37/1.94 Reduction : 0.10
% 3.37/1.94 Demodulation : 0.07
% 3.37/1.94 BG Simplification : 0.01
% 3.37/1.94 Subsumption : 0.09
% 3.37/1.94 Abstraction : 0.01
% 3.37/1.94 MUC search : 0.00
% 3.37/1.94 Cooper : 0.00
% 3.37/1.94 Total : 0.85
% 3.37/1.94 Index Insertion : 0.00
% 3.37/1.94 Index Deletion : 0.00
% 3.37/1.94 Index Matching : 0.00
% 3.37/1.94 BG Taut test : 0.00
%------------------------------------------------------------------------------