TSTP Solution File: SYN312-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN312-1 : TPTP v8.1.2. Bugfixed v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n008.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 : Fri Sep 1 01:51:02 EDT 2023
% Result : Unsatisfiable 0.18s 0.57s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of formulae : 35 ( 15 unt; 7 typ; 0 def)
% Number of atoms : 43 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 37 ( 22 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 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 : 39 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
p: ( $i * $i * $i ) > $o ).
tff(decl_23,type,
f: $i > $i ).
tff(decl_24,type,
g: $i > $i ).
tff(decl_25,type,
a: $i ).
tff(decl_26,type,
b: $i ).
tff(decl_27,type,
c: $i ).
tff(decl_28,type,
d: $i ).
cnf(clause8,negated_conjecture,
~ p(f(g(a)),f(g(d)),f(g(c))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).
cnf(clause4,negated_conjecture,
( p(X1,X2,f(X3))
| ~ p(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).
cnf(clause2,negated_conjecture,
( p(X1,X2,X3)
| ~ p(X3,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
cnf(clause5,negated_conjecture,
( p(g(X1),X2,X3)
| ~ p(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).
cnf(clause3,negated_conjecture,
( p(X1,X2,X3)
| ~ p(X2,X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).
cnf(clause1,negated_conjecture,
( p(X1,X2,X3)
| ~ p(X1,X4,X3)
| ~ p(X4,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
cnf(clause7,negated_conjecture,
p(f(b),d,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause7) ).
cnf(clause6,negated_conjecture,
p(a,f(b),c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).
cnf(c_0_8,negated_conjecture,
~ p(f(g(a)),f(g(d)),f(g(c))),
clause8 ).
cnf(c_0_9,negated_conjecture,
( p(X1,X2,f(X3))
| ~ p(X1,X2,X3) ),
clause4 ).
cnf(c_0_10,negated_conjecture,
( p(X1,X2,X3)
| ~ p(X3,X2,X1) ),
clause2 ).
cnf(c_0_11,negated_conjecture,
( p(g(X1),X2,X3)
| ~ p(X1,X2,X3) ),
clause5 ).
cnf(c_0_12,negated_conjecture,
~ p(f(g(a)),f(g(d)),g(c)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( p(X1,X2,g(X3))
| ~ p(X3,X2,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( p(X1,X2,X3)
| ~ p(X2,X1,X3) ),
clause3 ).
cnf(c_0_15,negated_conjecture,
( p(X1,X2,X3)
| ~ p(X1,X4,X3)
| ~ p(X4,X2,X3) ),
clause1 ).
cnf(c_0_16,negated_conjecture,
p(f(b),d,c),
clause7 ).
cnf(c_0_17,negated_conjecture,
~ p(c,f(g(d)),f(g(a))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
( p(X1,X2,f(X3))
| ~ p(X2,X1,X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_19,negated_conjecture,
( p(X1,d,c)
| ~ p(X1,f(b),c) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
p(a,f(b),c),
clause6 ).
cnf(c_0_21,negated_conjecture,
~ p(f(g(d)),c,g(a)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
p(a,d,c),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
~ p(a,c,f(g(d))),
inference(spm,[status(thm)],[c_0_21,c_0_13]) ).
cnf(c_0_24,negated_conjecture,
p(c,d,a),
inference(spm,[status(thm)],[c_0_10,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
~ p(a,c,g(d)),
inference(spm,[status(thm)],[c_0_23,c_0_9]) ).
cnf(c_0_26,negated_conjecture,
p(d,c,a),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_13]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN312-1 : TPTP v8.1.2. Bugfixed v2.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.16/0.33 % Computer : n008.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Sat Aug 26 17:13:32 EDT 2023
% 0.16/0.34 % CPUTime :
% 0.18/0.55 start to proof: theBenchmark
% 0.18/0.57 % Version : CSE_E---1.5
% 0.18/0.57 % Problem : theBenchmark.p
% 0.18/0.57 % Proof found
% 0.18/0.57 % SZS status Theorem for theBenchmark.p
% 0.18/0.57 % SZS output start Proof
% See solution above
% 0.18/0.57 % Total time : 0.006000 s
% 0.18/0.57 % SZS output end Proof
% 0.18/0.57 % Total time : 0.008000 s
%------------------------------------------------------------------------------