TSTP Solution File: ALG200+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : ALG200+1 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n031.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 : Wed Aug 30 16:06:30 EDT 2023
% Result : Theorem 0.20s 0.62s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of formulae : 20 ( 8 unt; 8 typ; 0 def)
% Number of atoms : 78 ( 77 equ)
% Maximal formula atoms : 21 ( 6 avg)
% Number of connectives : 97 ( 31 ~; 42 |; 24 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
e0: $i ).
tff(decl_23,type,
op: ( $i * $i ) > $i ).
tff(decl_24,type,
e1: $i ).
tff(decl_25,type,
e2: $i ).
tff(decl_26,type,
e3: $i ).
tff(decl_27,type,
e4: $i ).
tff(decl_28,type,
e5: $i ).
tff(decl_29,type,
e6: $i ).
fof(co1,conjecture,
~ ( op(e0,e0) = e0
& op(e1,e1) = e1
& op(e2,e2) = e2
& op(e3,e3) = e3
& op(e4,e4) = e4
& op(e5,e5) = e5
& op(e6,e6) = e6
& ( op(e0,e0) = e0
| op(e1,e1) = e1
| op(e2,e2) = e2
| op(e3,e3) = e3
| op(e4,e4) = e4
| op(e5,e5) = e5
| op(e6,e6) = e6 )
& ( op(e0,e0) != e0
| op(e1,e1) != e1
| op(e2,e2) != e2
| op(e3,e3) != e3
| op(e4,e4) != e4
| op(e5,e5) != e5
| op(e6,e6) != e6 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(c_0_1,negated_conjecture,
~ ~ ( op(e0,e0) = e0
& op(e1,e1) = e1
& op(e2,e2) = e2
& op(e3,e3) = e3
& op(e4,e4) = e4
& op(e5,e5) = e5
& op(e6,e6) = e6
& ( op(e0,e0) = e0
| op(e1,e1) = e1
| op(e2,e2) = e2
| op(e3,e3) = e3
| op(e4,e4) = e4
| op(e5,e5) = e5
| op(e6,e6) = e6 )
& ( op(e0,e0) != e0
| op(e1,e1) != e1
| op(e2,e2) != e2
| op(e3,e3) != e3
| op(e4,e4) != e4
| op(e5,e5) != e5
| op(e6,e6) != e6 ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_2,negated_conjecture,
( op(e0,e0) = e0
& op(e1,e1) = e1
& op(e2,e2) = e2
& op(e3,e3) = e3
& op(e4,e4) = e4
& op(e5,e5) = e5
& op(e6,e6) = e6
& ( op(e0,e0) = e0
| op(e1,e1) = e1
| op(e2,e2) = e2
| op(e3,e3) = e3
| op(e4,e4) = e4
| op(e5,e5) = e5
| op(e6,e6) = e6 )
& ( op(e0,e0) != e0
| op(e1,e1) != e1
| op(e2,e2) != e2
| op(e3,e3) != e3
| op(e4,e4) != e4
| op(e5,e5) != e5
| op(e6,e6) != e6 ) ),
inference(fof_nnf,[status(thm)],[c_0_1]) ).
cnf(c_0_3,negated_conjecture,
( op(e0,e0) != e0
| op(e1,e1) != e1
| op(e2,e2) != e2
| op(e3,e3) != e3
| op(e4,e4) != e4
| op(e5,e5) != e5
| op(e6,e6) != e6 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
op(e0,e0) = e0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
op(e1,e1) = e1,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
op(e2,e2) = e2,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
op(e3,e3) = e3,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
op(e4,e4) = e4,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
op(e5,e5) = e5,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
op(e6,e6) = e6,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4]),c_0_5]),c_0_6]),c_0_7]),c_0_8]),c_0_9]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : ALG200+1 : TPTP v8.1.2. Released v2.7.0.
% 0.12/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n031.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 03:48:39 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.20/0.58 start to proof: theBenchmark
% 0.20/0.62 % Version : CSE_E---1.5
% 0.20/0.62 % Problem : theBenchmark.p
% 0.20/0.62 % Proof found
% 0.20/0.62 % SZS status Theorem for theBenchmark.p
% 0.20/0.62 % SZS output start Proof
% See solution above
% 0.20/0.62 % Total time : 0.016000 s
% 0.20/0.62 % SZS output end Proof
% 0.20/0.62 % Total time : 0.026000 s
%------------------------------------------------------------------------------