TSTP Solution File: ALG020+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ALG020+1 : TPTP v8.2.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 : Mon May 20 18:06:29 EDT 2024
% Result : Theorem 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 57 ( 30 unt; 0 def)
% Number of atoms : 404 ( 387 equ)
% Maximal formula atoms : 72 ( 7 avg)
% Number of connectives : 401 ( 54 ~; 137 |; 206 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 43 ( 6 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
( ( ( h(e10) = e20
| h(e10) = e21
| h(e10) = e22
| h(e10) = e23 )
& ( h(e11) = e20
| h(e11) = e21
| h(e11) = e22
| h(e11) = e23 )
& ( h(e12) = e20
| h(e12) = e21
| h(e12) = e22
| h(e12) = e23 )
& ( h(e13) = e20
| h(e13) = e21
| h(e13) = e22
| h(e13) = e23 )
& ( j(e20) = e10
| j(e20) = e11
| j(e20) = e12
| j(e20) = e13 )
& ( j(e21) = e10
| j(e21) = e11
| j(e21) = e12
| j(e21) = e13 )
& ( j(e22) = e10
| j(e22) = e11
| j(e22) = e12
| j(e22) = e13 )
& ( j(e23) = e10
| j(e23) = e11
| j(e23) = e12
| j(e23) = e13 ) )
=> ~ ( h(op1(e10,e10)) = op2(h(e10),h(e10))
& h(op1(e10,e11)) = op2(h(e10),h(e11))
& h(op1(e10,e12)) = op2(h(e10),h(e12))
& h(op1(e10,e13)) = op2(h(e10),h(e13))
& h(op1(e11,e10)) = op2(h(e11),h(e10))
& h(op1(e11,e11)) = op2(h(e11),h(e11))
& h(op1(e11,e12)) = op2(h(e11),h(e12))
& h(op1(e11,e13)) = op2(h(e11),h(e13))
& h(op1(e12,e10)) = op2(h(e12),h(e10))
& h(op1(e12,e11)) = op2(h(e12),h(e11))
& h(op1(e12,e12)) = op2(h(e12),h(e12))
& h(op1(e12,e13)) = op2(h(e12),h(e13))
& h(op1(e13,e10)) = op2(h(e13),h(e10))
& h(op1(e13,e11)) = op2(h(e13),h(e11))
& h(op1(e13,e12)) = op2(h(e13),h(e12))
& h(op1(e13,e13)) = op2(h(e13),h(e13))
& j(op2(e20,e20)) = op1(j(e20),j(e20))
& j(op2(e20,e21)) = op1(j(e20),j(e21))
& j(op2(e20,e22)) = op1(j(e20),j(e22))
& j(op2(e20,e23)) = op1(j(e20),j(e23))
& j(op2(e21,e20)) = op1(j(e21),j(e20))
& j(op2(e21,e21)) = op1(j(e21),j(e21))
& j(op2(e21,e22)) = op1(j(e21),j(e22))
& j(op2(e21,e23)) = op1(j(e21),j(e23))
& j(op2(e22,e20)) = op1(j(e22),j(e20))
& j(op2(e22,e21)) = op1(j(e22),j(e21))
& j(op2(e22,e22)) = op1(j(e22),j(e22))
& j(op2(e22,e23)) = op1(j(e22),j(e23))
& j(op2(e23,e20)) = op1(j(e23),j(e20))
& j(op2(e23,e21)) = op1(j(e23),j(e21))
& j(op2(e23,e22)) = op1(j(e23),j(e22))
& j(op2(e23,e23)) = op1(j(e23),j(e23))
& h(j(e20)) = e20
& h(j(e21)) = e21
& h(j(e22)) = e22
& h(j(e23)) = e23
& j(h(e10)) = e10
& j(h(e11)) = e11
& j(h(e12)) = e12
& j(h(e13)) = e13 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax2,axiom,
( e20 != e21
& e20 != e22
& e20 != e23
& e21 != e22
& e21 != e23
& e22 != e23 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).
fof(ax4,axiom,
( op1(e10,e10) = e10
& op1(e10,e11) = e11
& op1(e10,e12) = e12
& op1(e10,e13) = e13
& op1(e11,e10) = e11
& op1(e11,e11) = e10
& op1(e11,e12) = e13
& op1(e11,e13) = e12
& op1(e12,e10) = e12
& op1(e12,e11) = e13
& op1(e12,e12) = e10
& op1(e12,e13) = e11
& op1(e13,e10) = e13
& op1(e13,e11) = e12
& op1(e13,e12) = e11
& op1(e13,e13) = e10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
fof(ax5,axiom,
( op2(e20,e20) = e20
& op2(e20,e21) = e21
& op2(e20,e22) = e22
& op2(e20,e23) = e23
& op2(e21,e20) = e21
& op2(e21,e21) = e23
& op2(e21,e22) = e20
& op2(e21,e23) = e22
& op2(e22,e20) = e22
& op2(e22,e21) = e20
& op2(e22,e22) = e23
& op2(e22,e23) = e21
& op2(e23,e20) = e23
& op2(e23,e21) = e22
& op2(e23,e22) = e21
& op2(e23,e23) = e20 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
fof(ax1,axiom,
( e10 != e11
& e10 != e12
& e10 != e13
& e11 != e12
& e11 != e13
& e12 != e13 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
fof(c_0_5,plain,
( epred1_0
<=> ( ( h(e10) = e20
| h(e10) = e21
| h(e10) = e22
| h(e10) = e23 )
& ( h(e11) = e20
| h(e11) = e21
| h(e11) = e22
| h(e11) = e23 )
& ( h(e12) = e20
| h(e12) = e21
| h(e12) = e22
| h(e12) = e23 )
& ( h(e13) = e20
| h(e13) = e21
| h(e13) = e22
| h(e13) = e23 )
& ( j(e20) = e10
| j(e20) = e11
| j(e20) = e12
| j(e20) = e13 )
& ( j(e21) = e10
| j(e21) = e11
| j(e21) = e12
| j(e21) = e13 )
& ( j(e22) = e10
| j(e22) = e11
| j(e22) = e12
| j(e22) = e13 )
& ( j(e23) = e10
| j(e23) = e11
| j(e23) = e12
| j(e23) = e13 ) ) ),
introduced(definition) ).
fof(c_0_6,negated_conjecture,
~ ( epred1_0
=> ~ ( h(op1(e10,e10)) = op2(h(e10),h(e10))
& h(op1(e10,e11)) = op2(h(e10),h(e11))
& h(op1(e10,e12)) = op2(h(e10),h(e12))
& h(op1(e10,e13)) = op2(h(e10),h(e13))
& h(op1(e11,e10)) = op2(h(e11),h(e10))
& h(op1(e11,e11)) = op2(h(e11),h(e11))
& h(op1(e11,e12)) = op2(h(e11),h(e12))
& h(op1(e11,e13)) = op2(h(e11),h(e13))
& h(op1(e12,e10)) = op2(h(e12),h(e10))
& h(op1(e12,e11)) = op2(h(e12),h(e11))
& h(op1(e12,e12)) = op2(h(e12),h(e12))
& h(op1(e12,e13)) = op2(h(e12),h(e13))
& h(op1(e13,e10)) = op2(h(e13),h(e10))
& h(op1(e13,e11)) = op2(h(e13),h(e11))
& h(op1(e13,e12)) = op2(h(e13),h(e12))
& h(op1(e13,e13)) = op2(h(e13),h(e13))
& j(op2(e20,e20)) = op1(j(e20),j(e20))
& j(op2(e20,e21)) = op1(j(e20),j(e21))
& j(op2(e20,e22)) = op1(j(e20),j(e22))
& j(op2(e20,e23)) = op1(j(e20),j(e23))
& j(op2(e21,e20)) = op1(j(e21),j(e20))
& j(op2(e21,e21)) = op1(j(e21),j(e21))
& j(op2(e21,e22)) = op1(j(e21),j(e22))
& j(op2(e21,e23)) = op1(j(e21),j(e23))
& j(op2(e22,e20)) = op1(j(e22),j(e20))
& j(op2(e22,e21)) = op1(j(e22),j(e21))
& j(op2(e22,e22)) = op1(j(e22),j(e22))
& j(op2(e22,e23)) = op1(j(e22),j(e23))
& j(op2(e23,e20)) = op1(j(e23),j(e20))
& j(op2(e23,e21)) = op1(j(e23),j(e21))
& j(op2(e23,e22)) = op1(j(e23),j(e22))
& j(op2(e23,e23)) = op1(j(e23),j(e23))
& h(j(e20)) = e20
& h(j(e21)) = e21
& h(j(e22)) = e22
& h(j(e23)) = e23
& j(h(e10)) = e10
& j(h(e11)) = e11
& j(h(e12)) = e12
& j(h(e13)) = e13 ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[co1]),c_0_5]) ).
fof(c_0_7,plain,
( epred1_0
=> ( ( h(e10) = e20
| h(e10) = e21
| h(e10) = e22
| h(e10) = e23 )
& ( h(e11) = e20
| h(e11) = e21
| h(e11) = e22
| h(e11) = e23 )
& ( h(e12) = e20
| h(e12) = e21
| h(e12) = e22
| h(e12) = e23 )
& ( h(e13) = e20
| h(e13) = e21
| h(e13) = e22
| h(e13) = e23 )
& ( j(e20) = e10
| j(e20) = e11
| j(e20) = e12
| j(e20) = e13 )
& ( j(e21) = e10
| j(e21) = e11
| j(e21) = e12
| j(e21) = e13 )
& ( j(e22) = e10
| j(e22) = e11
| j(e22) = e12
| j(e22) = e13 )
& ( j(e23) = e10
| j(e23) = e11
| j(e23) = e12
| j(e23) = e13 ) ) ),
inference(split_equiv,[status(thm)],[c_0_5]) ).
fof(c_0_8,negated_conjecture,
( epred1_0
& h(op1(e10,e10)) = op2(h(e10),h(e10))
& h(op1(e10,e11)) = op2(h(e10),h(e11))
& h(op1(e10,e12)) = op2(h(e10),h(e12))
& h(op1(e10,e13)) = op2(h(e10),h(e13))
& h(op1(e11,e10)) = op2(h(e11),h(e10))
& h(op1(e11,e11)) = op2(h(e11),h(e11))
& h(op1(e11,e12)) = op2(h(e11),h(e12))
& h(op1(e11,e13)) = op2(h(e11),h(e13))
& h(op1(e12,e10)) = op2(h(e12),h(e10))
& h(op1(e12,e11)) = op2(h(e12),h(e11))
& h(op1(e12,e12)) = op2(h(e12),h(e12))
& h(op1(e12,e13)) = op2(h(e12),h(e13))
& h(op1(e13,e10)) = op2(h(e13),h(e10))
& h(op1(e13,e11)) = op2(h(e13),h(e11))
& h(op1(e13,e12)) = op2(h(e13),h(e12))
& h(op1(e13,e13)) = op2(h(e13),h(e13))
& j(op2(e20,e20)) = op1(j(e20),j(e20))
& j(op2(e20,e21)) = op1(j(e20),j(e21))
& j(op2(e20,e22)) = op1(j(e20),j(e22))
& j(op2(e20,e23)) = op1(j(e20),j(e23))
& j(op2(e21,e20)) = op1(j(e21),j(e20))
& j(op2(e21,e21)) = op1(j(e21),j(e21))
& j(op2(e21,e22)) = op1(j(e21),j(e22))
& j(op2(e21,e23)) = op1(j(e21),j(e23))
& j(op2(e22,e20)) = op1(j(e22),j(e20))
& j(op2(e22,e21)) = op1(j(e22),j(e21))
& j(op2(e22,e22)) = op1(j(e22),j(e22))
& j(op2(e22,e23)) = op1(j(e22),j(e23))
& j(op2(e23,e20)) = op1(j(e23),j(e20))
& j(op2(e23,e21)) = op1(j(e23),j(e21))
& j(op2(e23,e22)) = op1(j(e23),j(e22))
& j(op2(e23,e23)) = op1(j(e23),j(e23))
& h(j(e20)) = e20
& h(j(e21)) = e21
& h(j(e22)) = e22
& h(j(e23)) = e23
& j(h(e10)) = e10
& j(h(e11)) = e11
& j(h(e12)) = e12
& j(h(e13)) = e13 ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
( ( h(e10) = e20
| h(e10) = e21
| h(e10) = e22
| h(e10) = e23
| ~ epred1_0 )
& ( h(e11) = e20
| h(e11) = e21
| h(e11) = e22
| h(e11) = e23
| ~ epred1_0 )
& ( h(e12) = e20
| h(e12) = e21
| h(e12) = e22
| h(e12) = e23
| ~ epred1_0 )
& ( h(e13) = e20
| h(e13) = e21
| h(e13) = e22
| h(e13) = e23
| ~ epred1_0 )
& ( j(e20) = e10
| j(e20) = e11
| j(e20) = e12
| j(e20) = e13
| ~ epred1_0 )
& ( j(e21) = e10
| j(e21) = e11
| j(e21) = e12
| j(e21) = e13
| ~ epred1_0 )
& ( j(e22) = e10
| j(e22) = e11
| j(e22) = e12
| j(e22) = e13
| ~ epred1_0 )
& ( j(e23) = e10
| j(e23) = e11
| j(e23) = e12
| j(e23) = e13
| ~ epred1_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_10,plain,
( e20 != e21
& e20 != e22
& e20 != e23
& e21 != e22
& e21 != e23
& e22 != e23 ),
inference(fof_simplification,[status(thm)],[ax2]) ).
cnf(c_0_11,negated_conjecture,
h(op1(e10,e10)) = op2(h(e10),h(e10)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
op1(e10,e10) = e10,
inference(split_conjunct,[status(thm)],[ax4]) ).
cnf(c_0_13,plain,
( h(e10) = e20
| h(e10) = e21
| h(e10) = e22
| h(e10) = e23
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_15,plain,
( e20 != e21
& e20 != e22
& e20 != e23
& e21 != e22
& e21 != e23
& e22 != e23 ),
inference(fof_nnf,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
op2(h(e10),h(e10)) = h(e10),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( h(e10) = e23
| h(e10) = e22
| h(e10) = e21
| h(e10) = e20 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_18,plain,
op2(e23,e23) = e20,
inference(split_conjunct,[status(thm)],[ax5]) ).
cnf(c_0_19,plain,
e20 != e23,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( h(e10) = e22
| h(e10) = e21
| h(e10) = e20 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]) ).
cnf(c_0_21,plain,
op2(e22,e22) = e23,
inference(split_conjunct,[status(thm)],[ax5]) ).
cnf(c_0_22,plain,
e22 != e23,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
h(op1(e11,e11)) = op2(h(e11),h(e11)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24,plain,
op1(e11,e11) = e10,
inference(split_conjunct,[status(thm)],[ax4]) ).
cnf(c_0_25,negated_conjecture,
( h(e10) = e20
| h(e10) = e21 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_20]),c_0_21]),c_0_22]) ).
cnf(c_0_26,plain,
op2(e21,e21) = e23,
inference(split_conjunct,[status(thm)],[ax5]) ).
cnf(c_0_27,plain,
e21 != e23,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_28,plain,
( h(e11) = e20
| h(e11) = e21
| h(e11) = e22
| h(e11) = e23
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_29,negated_conjecture,
op2(h(e11),h(e11)) = h(e10),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
h(e10) = e20,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_25]),c_0_26]),c_0_27]) ).
cnf(c_0_31,negated_conjecture,
j(h(e11)) = e11,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_32,plain,
( h(e11) = e23
| h(e11) = e22
| h(e11) = e21
| h(e11) = e20 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_14])]) ).
cnf(c_0_33,negated_conjecture,
op2(h(e11),h(e11)) = e20,
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( h(e11) = e22
| h(e11) = e21
| h(e11) = e20
| j(e23) = e11 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
fof(c_0_35,plain,
( e10 != e11
& e10 != e12
& e10 != e13
& e11 != e12
& e11 != e13
& e12 != e13 ),
inference(fof_simplification,[status(thm)],[ax1]) ).
cnf(c_0_36,negated_conjecture,
( j(e23) = e11
| h(e11) = e20
| h(e11) = e21 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_21]),c_0_19]) ).
cnf(c_0_37,negated_conjecture,
j(h(e10)) = e10,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_38,plain,
( e10 != e11
& e10 != e12
& e10 != e13
& e11 != e12
& e11 != e13
& e12 != e13 ),
inference(fof_nnf,[status(thm)],[c_0_35]) ).
cnf(c_0_39,negated_conjecture,
j(op2(e22,e22)) = op1(j(e22),j(e22)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_40,negated_conjecture,
( h(e11) = e20
| j(e23) = e11 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_36]),c_0_26]),c_0_19]) ).
cnf(c_0_41,negated_conjecture,
j(e20) = e10,
inference(rw,[status(thm)],[c_0_37,c_0_30]) ).
cnf(c_0_42,plain,
e10 != e11,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_43,negated_conjecture,
op1(j(e22),j(e22)) = j(e23),
inference(rw,[status(thm)],[c_0_39,c_0_21]) ).
cnf(c_0_44,negated_conjecture,
j(e23) = e11,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_40]),c_0_41]),c_0_42]) ).
cnf(c_0_45,plain,
( j(e22) = e10
| j(e22) = e11
| j(e22) = e12
| j(e22) = e13
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_46,negated_conjecture,
op1(j(e22),j(e22)) = e11,
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,plain,
( j(e22) = e13
| j(e22) = e12
| j(e22) = e11
| j(e22) = e10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_14])]) ).
cnf(c_0_48,plain,
op1(e13,e13) = e10,
inference(split_conjunct,[status(thm)],[ax4]) ).
cnf(c_0_49,plain,
( j(e22) = e12
| j(e22) = e11
| j(e22) = e10 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_42]) ).
cnf(c_0_50,plain,
op1(e12,e12) = e10,
inference(split_conjunct,[status(thm)],[ax4]) ).
cnf(c_0_51,negated_conjecture,
h(j(e23)) = e23,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_52,negated_conjecture,
h(j(e22)) = e22,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_53,negated_conjecture,
( j(e22) = e10
| j(e22) = e11 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_49]),c_0_50]),c_0_42]) ).
cnf(c_0_54,negated_conjecture,
h(e11) = e23,
inference(rw,[status(thm)],[c_0_51,c_0_44]) ).
cnf(c_0_55,negated_conjecture,
j(e22) = e10,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_22]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_55]),c_0_55]),c_0_12]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : ALG020+1 : TPTP v8.2.0. Released v2.7.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n005.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sat May 18 23:22:23 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.21/0.51 Running first-order model finding
% 0.21/0.51 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.53 # Version: 3.1.0
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 10420 completed with status 0
% 0.21/0.53 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FGUSF-FFMM21-SFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.53 # Starting sh5l with 136s (1) cores
% 0.21/0.53 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 10425 completed with status 0
% 0.21/0.53 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FGUSF-FFMM21-SFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.53 # Preprocessing time : 0.001 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Theorem
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 6
% 0.21/0.53 # Removed by relevancy pruning/SinE : 0
% 0.21/0.53 # Initial clauses : 109
% 0.21/0.53 # Removed in clause preprocessing : 0
% 0.21/0.53 # Initial clauses in saturation : 109
% 0.21/0.53 # Processed clauses : 278
% 0.21/0.53 # ...of these trivial : 1
% 0.21/0.53 # ...subsumed : 18
% 0.21/0.53 # ...remaining for further processing : 259
% 0.21/0.53 # Other redundant clauses eliminated : 0
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 6
% 0.21/0.53 # Backward-rewritten : 57
% 0.21/0.53 # Generated clauses : 160
% 0.21/0.53 # ...of the previous two non-redundant : 164
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 0
% 0.21/0.53 # Paramodulations : 130
% 0.21/0.53 # Factorizations : 30
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 0
% 0.21/0.53 # Disequality decompositions : 0
% 0.21/0.53 # Total rewrite steps : 185
% 0.21/0.53 # ...of those cached : 137
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 87
% 0.21/0.53 # Positive orientable unit clauses : 56
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 28
% 0.21/0.53 # Non-unit-clauses : 3
% 0.21/0.53 # Current number of unprocessed clauses: 70
% 0.21/0.53 # ...number of literals in the above : 251
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 172
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 6
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 6
% 0.21/0.53 # Non-unit clause-clause subsumptions : 6
% 0.21/0.53 # Unit Clause-clause subsumption calls : 686
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 5
% 0.21/0.53 # BW rewrite match successes : 5
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 4914
% 0.21/0.53 # Search garbage collected termcells : 418
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.010 s
% 0.21/0.53 # System time : 0.002 s
% 0.21/0.53 # Total time : 0.012 s
% 0.21/0.53 # Maximum resident set size: 1816 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.041 s
% 0.21/0.53 # System time : 0.008 s
% 0.21/0.53 # Total time : 0.049 s
% 0.21/0.53 # Maximum resident set size: 1744 pages
% 0.21/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------