%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : ALG227+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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 : 600s
% DateTime : Thu Jul 14 16:50:35 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 15 unt; 0 def)
% Number of atoms : 110 ( 34 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 123 ( 49 ~; 43 |; 17 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 46 ( 1 sgn 26 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t8_boole,axiom,
! [X1,X2] :
~ ( v1_xboole_0(X1)
& X1 != X2
& v1_xboole_0(X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_boole) ).
fof(rc1_xboole_0,axiom,
? [X1] : v1_xboole_0(X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc1_xboole_0) ).
fof(t8_closure3,conjecture,
! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( m1_pboole(X2,X1)
=> ! [X3] :
( m1_subset_1(X3,X1)
=> ( ~ r2_hidden(X3,k1_closure3(X1,X2))
=> k1_funct_1(X2,X3) = k1_xboole_0 ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_closure3) ).
fof(t6_boole,axiom,
! [X1] :
( v1_xboole_0(X1)
=> X1 = k1_xboole_0 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t6_boole) ).
fof(rc2_funct_1,axiom,
? [X1] :
( v1_relat_1(X1)
& v1_xboole_0(X1)
& v1_funct_1(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc2_funct_1) ).
fof(fraenkel_a_2_0_closure3,axiom,
! [X1,X2,X3] :
( ( ~ v1_xboole_0(X2)
& m1_pboole(X3,X2) )
=> ( r2_hidden(X1,a_2_0_closure3(X2,X3))
<=> ? [X4] :
( m1_subset_1(X4,X2)
& X1 = X4
& k1_funct_1(X3,X4) != k1_xboole_0 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fraenkel_a_2_0_closure3) ).
fof(d3_closure3,axiom,
! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( m1_pboole(X2,X1)
=> ! [X3] :
( X3 = k1_closure3(X1,X2)
<=> X3 = a_2_0_closure3(X1,X2) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_closure3) ).
fof(c_0_7,plain,
! [X3,X4] :
( ~ v1_xboole_0(X3)
| X3 = X4
| ~ v1_xboole_0(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_boole])]) ).
fof(c_0_8,plain,
v1_xboole_0(esk8_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( m1_pboole(X2,X1)
=> ! [X3] :
( m1_subset_1(X3,X1)
=> ( ~ r2_hidden(X3,k1_closure3(X1,X2))
=> k1_funct_1(X2,X3) = k1_xboole_0 ) ) ) ),
inference(assume_negation,[status(cth)],[t8_closure3]) ).
fof(c_0_10,plain,
! [X2] :
( ~ v1_xboole_0(X2)
| X2 = k1_xboole_0 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_11,plain,
( v1_relat_1(esk11_0)
& v1_xboole_0(esk11_0)
& v1_funct_1(esk11_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc2_funct_1])]) ).
cnf(c_0_12,plain,
( X2 = X1
| ~ v1_xboole_0(X1)
| ~ v1_xboole_0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
v1_xboole_0(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,negated_conjecture,
( ~ v1_xboole_0(esk1_0)
& m1_pboole(esk2_0,esk1_0)
& m1_subset_1(esk3_0,esk1_0)
& ~ r2_hidden(esk3_0,k1_closure3(esk1_0,esk2_0))
& k1_funct_1(esk2_0,esk3_0) != k1_xboole_0 ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_9])])])])])]) ).
cnf(c_0_15,plain,
( X1 = k1_xboole_0
| ~ v1_xboole_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
v1_xboole_0(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X5,X6,X7,X9] :
( ( m1_subset_1(esk4_3(X5,X6,X7),X6)
| ~ r2_hidden(X5,a_2_0_closure3(X6,X7))
| v1_xboole_0(X6)
| ~ m1_pboole(X7,X6) )
& ( X5 = esk4_3(X5,X6,X7)
| ~ r2_hidden(X5,a_2_0_closure3(X6,X7))
| v1_xboole_0(X6)
| ~ m1_pboole(X7,X6) )
& ( k1_funct_1(X7,esk4_3(X5,X6,X7)) != k1_xboole_0
| ~ r2_hidden(X5,a_2_0_closure3(X6,X7))
| v1_xboole_0(X6)
| ~ m1_pboole(X7,X6) )
& ( ~ m1_subset_1(X9,X6)
| X5 != X9
| k1_funct_1(X7,X9) = k1_xboole_0
| r2_hidden(X5,a_2_0_closure3(X6,X7))
| v1_xboole_0(X6)
| ~ m1_pboole(X7,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[fraenkel_a_2_0_closure3])])])])])])])]) ).
cnf(c_0_18,plain,
( X1 = esk8_0
| ~ v1_xboole_0(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_19,plain,
! [X4,X5,X6,X6] :
( ( X6 != k1_closure3(X4,X5)
| X6 = a_2_0_closure3(X4,X5)
| ~ m1_pboole(X5,X4)
| v1_xboole_0(X4) )
& ( X6 != a_2_0_closure3(X4,X5)
| X6 = k1_closure3(X4,X5)
| ~ m1_pboole(X5,X4)
| v1_xboole_0(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[d3_closure3])])])])])])]) ).
cnf(c_0_20,negated_conjecture,
k1_funct_1(esk2_0,esk3_0) != k1_xboole_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
k1_xboole_0 = esk11_0,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( v1_xboole_0(X2)
| r2_hidden(X3,a_2_0_closure3(X2,X1))
| k1_funct_1(X1,X4) = k1_xboole_0
| ~ m1_pboole(X1,X2)
| X3 != X4
| ~ m1_subset_1(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
esk11_0 = esk8_0,
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_24,plain,
( v1_xboole_0(X1)
| X3 = k1_closure3(X1,X2)
| ~ m1_pboole(X2,X1)
| X3 != a_2_0_closure3(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
k1_funct_1(esk2_0,esk3_0) != esk11_0,
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( k1_funct_1(X1,X2) = esk8_0
| r2_hidden(X2,a_2_0_closure3(X3,X1))
| v1_xboole_0(X3)
| ~ m1_subset_1(X2,X3)
| ~ m1_pboole(X1,X3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_22]),c_0_21]),c_0_23]) ).
cnf(c_0_27,negated_conjecture,
m1_subset_1(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_28,negated_conjecture,
~ v1_xboole_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_29,negated_conjecture,
~ r2_hidden(esk3_0,k1_closure3(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_30,plain,
( k1_closure3(X1,X2) = a_2_0_closure3(X1,X2)
| v1_xboole_0(X1)
| ~ m1_pboole(X2,X1) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_31,negated_conjecture,
m1_pboole(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_32,negated_conjecture,
k1_funct_1(esk2_0,esk3_0) != esk8_0,
inference(rw,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_33,negated_conjecture,
( k1_funct_1(X1,esk3_0) = esk8_0
| r2_hidden(esk3_0,a_2_0_closure3(esk1_0,X1))
| ~ m1_pboole(X1,esk1_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_34,negated_conjecture,
~ r2_hidden(esk3_0,a_2_0_closure3(esk1_0,esk2_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),c_0_28]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_31])]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : ALG227+1 : TPTP v8.1.0. Released v3.4.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n019.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 : 600
% 0.13/0.35 % DateTime : Wed Jun 8 09:12:55 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.017 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.43 # Proof object total steps : 36
% 0.24/1.43 # Proof object clause steps : 21
% 0.24/1.43 # Proof object formula steps : 15
% 0.24/1.43 # Proof object conjectures : 13
% 0.24/1.43 # Proof object clause conjectures : 10
% 0.24/1.43 # Proof object formula conjectures : 3
% 0.24/1.43 # Proof object initial clauses used : 11
% 0.24/1.43 # Proof object initial formulas used : 7
% 0.24/1.43 # Proof object generating inferences : 7
% 0.24/1.43 # Proof object simplifying inferences : 12
% 0.24/1.43 # Training examples: 0 positive, 0 negative
% 0.24/1.43 # Parsed axioms : 29
% 0.24/1.43 # Removed by relevancy pruning/SinE : 10
% 0.24/1.43 # Initial clauses : 32
% 0.24/1.43 # Removed in clause preprocessing : 0
% 0.24/1.43 # Initial clauses in saturation : 32
% 0.24/1.43 # Processed clauses : 77
% 0.24/1.43 # ...of these trivial : 0
% 0.24/1.43 # ...subsumed : 11
% 0.24/1.43 # ...remaining for further processing : 66
% 0.24/1.43 # Other redundant clauses eliminated : 1
% 0.24/1.43 # Clauses deleted for lack of memory : 0
% 0.24/1.43 # Backward-subsumed : 0
% 0.24/1.43 # Backward-rewritten : 9
% 0.24/1.43 # Generated clauses : 78
% 0.24/1.43 # ...of the previous two non-trivial : 77
% 0.24/1.43 # Contextual simplify-reflections : 2
% 0.24/1.43 # Paramodulations : 73
% 0.24/1.43 # Factorizations : 2
% 0.24/1.43 # Equation resolutions : 3
% 0.24/1.43 # Current number of processed clauses : 56
% 0.24/1.43 # Positive orientable unit clauses : 16
% 0.24/1.43 # Positive unorientable unit clauses: 0
% 0.24/1.43 # Negative unit clauses : 6
% 0.24/1.43 # Non-unit-clauses : 34
% 0.24/1.43 # Current number of unprocessed clauses: 29
% 0.24/1.43 # ...number of literals in the above : 145
% 0.24/1.43 # Current number of archived formulas : 0
% 0.24/1.43 # Current number of archived clauses : 9
% 0.24/1.43 # Clause-clause subsumption calls (NU) : 230
% 0.24/1.43 # Rec. Clause-clause subsumption calls : 183
% 0.24/1.43 # Non-unit clause-clause subsumptions : 12
% 0.24/1.43 # Unit Clause-clause subsumption calls : 54
% 0.24/1.43 # Rewrite failures with RHS unbound : 0
% 0.24/1.43 # BW rewrite match attempts : 2
% 0.24/1.43 # BW rewrite match successes : 2
% 0.24/1.43 # Condensation attempts : 0
% 0.24/1.43 # Condensation successes : 0
% 0.24/1.43 # Termbank termtop insertions : 2652
% 0.24/1.43
% 0.24/1.43 # -------------------------------------------------
% 0.24/1.43 # User time : 0.021 s
% 0.24/1.43 # System time : 0.000 s
% 0.24/1.43 # Total time : 0.021 s
% 0.24/1.43 # Maximum resident set size: 2976 pages
%------------------------------------------------------------------------------