TSTP Solution File: SYN311-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN311-1 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n021.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.21s 0.64s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 29 ( 13 unt; 7 typ; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 27 ( 18 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 36 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
p: ( $i * $i * $i * $i ) > $o ).
tff(decl_23,type,
g: $i > $i ).
tff(decl_24,type,
f: $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(clause6,negated_conjecture,
~ p(f(g(d)),f(g(c)),f(g(b)),f(g(a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).
cnf(clause4,negated_conjecture,
( p(f(X1),X2,X3,X4)
| ~ p(X1,X2,X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).
cnf(clause1,negated_conjecture,
( p(X1,X2,X3,X4)
| ~ p(X2,X3,X4,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
cnf(clause3,negated_conjecture,
( p(X1,X2,X3,g(X4))
| ~ p(X1,X2,X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).
cnf(clause2,negated_conjecture,
( p(X1,X2,X3,X4)
| ~ p(X4,X3,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
cnf(clause5,negated_conjecture,
p(a,b,c,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).
cnf(c_0_6,negated_conjecture,
~ p(f(g(d)),f(g(c)),f(g(b)),f(g(a))),
clause6 ).
cnf(c_0_7,negated_conjecture,
( p(f(X1),X2,X3,X4)
| ~ p(X1,X2,X3,X4) ),
clause4 ).
cnf(c_0_8,negated_conjecture,
( p(X1,X2,X3,X4)
| ~ p(X2,X3,X4,X1) ),
clause1 ).
cnf(c_0_9,negated_conjecture,
( p(X1,X2,X3,g(X4))
| ~ p(X1,X2,X3,X4) ),
clause3 ).
cnf(c_0_10,negated_conjecture,
~ p(g(d),f(g(c)),f(g(b)),f(g(a))),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( p(g(X1),X2,X3,X4)
| ~ p(X2,X3,X4,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
~ p(f(g(c)),f(g(b)),f(g(a)),d),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,negated_conjecture,
~ p(g(c),f(g(b)),f(g(a)),d),
inference(spm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_14,negated_conjecture,
~ p(f(g(b)),f(g(a)),d,c),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
~ p(g(b),f(g(a)),d,c),
inference(spm,[status(thm)],[c_0_14,c_0_7]) ).
cnf(c_0_16,negated_conjecture,
~ p(f(g(a)),d,c,b),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( p(X1,X2,X3,X4)
| ~ p(X4,X3,X2,X1) ),
clause2 ).
cnf(c_0_18,negated_conjecture,
p(a,b,c,d),
clause5 ).
cnf(c_0_19,negated_conjecture,
~ p(g(a),d,c,b),
inference(spm,[status(thm)],[c_0_16,c_0_7]) ).
cnf(c_0_20,negated_conjecture,
p(d,c,b,a),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_11]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.18 % Problem : SYN311-1 : TPTP v8.1.2. Released v1.2.0.
% 0.13/0.19 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.40 % Computer : n021.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8042.1875MB
% 0.14/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Sat Aug 26 17:36:57 EDT 2023
% 0.14/0.40 % CPUTime :
% 0.21/0.63 start to proof: theBenchmark
% 0.21/0.64 % Version : CSE_E---1.5
% 0.21/0.64 % Problem : theBenchmark.p
% 0.21/0.64 % Proof found
% 0.21/0.64 % SZS status Theorem for theBenchmark.p
% 0.21/0.64 % SZS output start Proof
% See solution above
% 0.21/0.64 % Total time : 0.004000 s
% 0.21/0.64 % SZS output end Proof
% 0.21/0.64 % Total time : 0.006000 s
%------------------------------------------------------------------------------