TSTP Solution File: MSC015-1.005 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : MSC015-1.005 : TPTP v8.1.2. Released v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n001.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 : Thu Aug 31 09:21:05 EDT 2023
% Result : Unsatisfiable 0.20s 0.55s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 10
% Syntax : Number of formulae : 48 ( 35 unt; 3 typ; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 52 ( 42 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 1 >; 4 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-5 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 20 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
s0: $i ).
tff(decl_23,type,
p: ( $i * $i * $i * $i * $i ) > $o ).
tff(decl_24,type,
s1: $i ).
cnf(goal,negated_conjecture,
~ p(s1,s1,s1,s1,s1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(rule1,axiom,
( p(X1,X2,X3,X4,s1)
| ~ p(X1,X2,X3,X4,s0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule1) ).
cnf(rule2,axiom,
( p(X1,X2,X3,s1,s0)
| ~ p(X1,X2,X3,s0,s1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule2) ).
cnf(rule3,axiom,
( p(X1,X2,s1,s0,s0)
| ~ p(X1,X2,s0,s1,s1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule3) ).
cnf(rule4,axiom,
( p(X1,s1,s0,s0,s0)
| ~ p(X1,s0,s1,s1,s1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule4) ).
cnf(rule5,axiom,
( p(s1,s0,s0,s0,s0)
| ~ p(s0,s1,s1,s1,s1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule5) ).
cnf(init,axiom,
p(s0,s0,s0,s0,s0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',init) ).
cnf(c_0_7,negated_conjecture,
~ p(s1,s1,s1,s1,s1),
goal ).
cnf(c_0_8,axiom,
( p(X1,X2,X3,X4,s1)
| ~ p(X1,X2,X3,X4,s0) ),
rule1 ).
cnf(c_0_9,negated_conjecture,
~ p(s1,s1,s1,s1,s0),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
( p(X1,X2,X3,s1,s0)
| ~ p(X1,X2,X3,s0,s1) ),
rule2 ).
cnf(c_0_11,negated_conjecture,
~ p(s1,s1,s1,s0,s1),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
~ p(s1,s1,s1,s0,s0),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_13,axiom,
( p(X1,X2,s1,s0,s0)
| ~ p(X1,X2,s0,s1,s1) ),
rule3 ).
cnf(c_0_14,negated_conjecture,
~ p(s1,s1,s0,s1,s1),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,negated_conjecture,
~ p(s1,s1,s0,s1,s0),
inference(spm,[status(thm)],[c_0_14,c_0_8]) ).
cnf(c_0_16,negated_conjecture,
~ p(s1,s1,s0,s0,s1),
inference(spm,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_17,negated_conjecture,
~ p(s1,s1,s0,s0,s0),
inference(spm,[status(thm)],[c_0_16,c_0_8]) ).
cnf(c_0_18,axiom,
( p(X1,s1,s0,s0,s0)
| ~ p(X1,s0,s1,s1,s1) ),
rule4 ).
cnf(c_0_19,negated_conjecture,
~ p(s1,s0,s1,s1,s1),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
~ p(s1,s0,s1,s1,s0),
inference(spm,[status(thm)],[c_0_19,c_0_8]) ).
cnf(c_0_21,negated_conjecture,
~ p(s1,s0,s1,s0,s1),
inference(spm,[status(thm)],[c_0_20,c_0_10]) ).
cnf(c_0_22,negated_conjecture,
~ p(s1,s0,s1,s0,s0),
inference(spm,[status(thm)],[c_0_21,c_0_8]) ).
cnf(c_0_23,negated_conjecture,
~ p(s1,s0,s0,s1,s1),
inference(spm,[status(thm)],[c_0_22,c_0_13]) ).
cnf(c_0_24,negated_conjecture,
~ p(s1,s0,s0,s1,s0),
inference(spm,[status(thm)],[c_0_23,c_0_8]) ).
cnf(c_0_25,negated_conjecture,
~ p(s1,s0,s0,s0,s1),
inference(spm,[status(thm)],[c_0_24,c_0_10]) ).
cnf(c_0_26,negated_conjecture,
~ p(s1,s0,s0,s0,s0),
inference(spm,[status(thm)],[c_0_25,c_0_8]) ).
cnf(c_0_27,axiom,
( p(s1,s0,s0,s0,s0)
| ~ p(s0,s1,s1,s1,s1) ),
rule5 ).
cnf(c_0_28,negated_conjecture,
~ p(s0,s1,s1,s1,s1),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
~ p(s0,s1,s1,s1,s0),
inference(spm,[status(thm)],[c_0_28,c_0_8]) ).
cnf(c_0_30,negated_conjecture,
~ p(s0,s1,s1,s0,s1),
inference(spm,[status(thm)],[c_0_29,c_0_10]) ).
cnf(c_0_31,negated_conjecture,
~ p(s0,s1,s1,s0,s0),
inference(spm,[status(thm)],[c_0_30,c_0_8]) ).
cnf(c_0_32,negated_conjecture,
~ p(s0,s1,s0,s1,s1),
inference(spm,[status(thm)],[c_0_31,c_0_13]) ).
cnf(c_0_33,negated_conjecture,
~ p(s0,s1,s0,s1,s0),
inference(spm,[status(thm)],[c_0_32,c_0_8]) ).
cnf(c_0_34,negated_conjecture,
~ p(s0,s1,s0,s0,s1),
inference(spm,[status(thm)],[c_0_33,c_0_10]) ).
cnf(c_0_35,negated_conjecture,
~ p(s0,s1,s0,s0,s0),
inference(spm,[status(thm)],[c_0_34,c_0_8]) ).
cnf(c_0_36,negated_conjecture,
~ p(s0,s0,s1,s1,s1),
inference(spm,[status(thm)],[c_0_35,c_0_18]) ).
cnf(c_0_37,negated_conjecture,
~ p(s0,s0,s1,s1,s0),
inference(spm,[status(thm)],[c_0_36,c_0_8]) ).
cnf(c_0_38,negated_conjecture,
~ p(s0,s0,s1,s0,s1),
inference(spm,[status(thm)],[c_0_37,c_0_10]) ).
cnf(c_0_39,negated_conjecture,
~ p(s0,s0,s1,s0,s0),
inference(spm,[status(thm)],[c_0_38,c_0_8]) ).
cnf(c_0_40,negated_conjecture,
~ p(s0,s0,s0,s1,s1),
inference(spm,[status(thm)],[c_0_39,c_0_13]) ).
cnf(c_0_41,negated_conjecture,
~ p(s0,s0,s0,s1,s0),
inference(spm,[status(thm)],[c_0_40,c_0_8]) ).
cnf(c_0_42,negated_conjecture,
~ p(s0,s0,s0,s0,s1),
inference(spm,[status(thm)],[c_0_41,c_0_10]) ).
cnf(c_0_43,axiom,
p(s0,s0,s0,s0,s0),
init ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_8]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MSC015-1.005 : TPTP v8.1.2. Released v3.5.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n001.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 24 14:21:11 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.54 start to proof: theBenchmark
% 0.20/0.55 % Version : CSE_E---1.5
% 0.20/0.55 % Problem : theBenchmark.p
% 0.20/0.55 % Proof found
% 0.20/0.55 % SZS status Theorem for theBenchmark.p
% 0.20/0.55 % SZS output start Proof
% See solution above
% 0.20/0.55 % Total time : 0.004000 s
% 0.20/0.55 % SZS output end Proof
% 0.20/0.55 % Total time : 0.006000 s
%------------------------------------------------------------------------------