TSTP Solution File: SET776+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET776+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n016.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 : Tue Jul 19 00:54:16 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 27 ( 13 unt; 0 def)
% Number of atoms : 157 ( 0 equ)
% Maximal formula atoms : 46 ( 5 avg)
% Number of connectives : 189 ( 59 ~; 72 |; 44 &)
% ( 3 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 51 ( 2 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thIII12,conjecture,
! [X4,X8,X7] :
( ( pre_order(X8,X4)
& ! [X1,X2] :
( ( member(X1,X4)
& member(X2,X4) )
=> ( apply(X7,X1,X2)
<=> ( apply(X8,X1,X2)
& apply(X8,X2,X1) ) ) ) )
=> ! [X9,X10,X11,X12] :
( ( member(X9,X4)
& member(X10,X4)
& member(X11,X4)
& member(X12,X4) )
=> ( ( apply(X7,X9,X11)
& apply(X7,X10,X12)
& apply(X8,X9,X10) )
=> apply(X8,X11,X12) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thIII12) ).
fof(pre_order,axiom,
! [X7,X4] :
( pre_order(X7,X4)
<=> ( ! [X3] :
( member(X3,X4)
=> apply(X7,X3,X3) )
& ! [X3,X5,X6] :
( ( member(X3,X4)
& member(X5,X4)
& member(X6,X4) )
=> ( ( apply(X7,X3,X5)
& apply(X7,X5,X6) )
=> apply(X7,X3,X6) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+2.ax',pre_order) ).
fof(c_0_2,negated_conjecture,
~ ! [X4,X8,X7] :
( ( pre_order(X8,X4)
& ! [X1,X2] :
( ( member(X1,X4)
& member(X2,X4) )
=> ( apply(X7,X1,X2)
<=> ( apply(X8,X1,X2)
& apply(X8,X2,X1) ) ) ) )
=> ! [X9,X10,X11,X12] :
( ( member(X9,X4)
& member(X10,X4)
& member(X11,X4)
& member(X12,X4) )
=> ( ( apply(X7,X9,X11)
& apply(X7,X10,X12)
& apply(X8,X9,X10) )
=> apply(X8,X11,X12) ) ) ),
inference(assume_negation,[status(cth)],[thIII12]) ).
fof(c_0_3,negated_conjecture,
! [X16,X17] :
( pre_order(esk2_0,esk1_0)
& ( apply(esk2_0,X16,X17)
| ~ apply(esk3_0,X16,X17)
| ~ member(X16,esk1_0)
| ~ member(X17,esk1_0) )
& ( apply(esk2_0,X17,X16)
| ~ apply(esk3_0,X16,X17)
| ~ member(X16,esk1_0)
| ~ member(X17,esk1_0) )
& ( ~ apply(esk2_0,X16,X17)
| ~ apply(esk2_0,X17,X16)
| apply(esk3_0,X16,X17)
| ~ member(X16,esk1_0)
| ~ member(X17,esk1_0) )
& member(esk4_0,esk1_0)
& member(esk5_0,esk1_0)
& member(esk6_0,esk1_0)
& member(esk7_0,esk1_0)
& apply(esk3_0,esk4_0,esk6_0)
& apply(esk3_0,esk5_0,esk7_0)
& apply(esk2_0,esk4_0,esk5_0)
& ~ apply(esk2_0,esk6_0,esk7_0) ),
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)],[c_0_2])])])])])])]) ).
cnf(c_0_4,negated_conjecture,
( apply(esk2_0,X2,X1)
| ~ member(X1,esk1_0)
| ~ member(X2,esk1_0)
| ~ apply(esk3_0,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
member(esk5_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_6,plain,
! [X8,X9,X10,X11,X12,X13,X8,X9] :
( ( ~ member(X10,X9)
| apply(X8,X10,X10)
| ~ pre_order(X8,X9) )
& ( ~ member(X11,X9)
| ~ member(X12,X9)
| ~ member(X13,X9)
| ~ apply(X8,X11,X12)
| ~ apply(X8,X12,X13)
| apply(X8,X11,X13)
| ~ pre_order(X8,X9) )
& ( member(esk9_2(X8,X9),X9)
| member(esk8_2(X8,X9),X9)
| pre_order(X8,X9) )
& ( member(esk10_2(X8,X9),X9)
| member(esk8_2(X8,X9),X9)
| pre_order(X8,X9) )
& ( member(esk11_2(X8,X9),X9)
| member(esk8_2(X8,X9),X9)
| pre_order(X8,X9) )
& ( apply(X8,esk9_2(X8,X9),esk10_2(X8,X9))
| member(esk8_2(X8,X9),X9)
| pre_order(X8,X9) )
& ( apply(X8,esk10_2(X8,X9),esk11_2(X8,X9))
| member(esk8_2(X8,X9),X9)
| pre_order(X8,X9) )
& ( ~ apply(X8,esk9_2(X8,X9),esk11_2(X8,X9))
| member(esk8_2(X8,X9),X9)
| pre_order(X8,X9) )
& ( member(esk9_2(X8,X9),X9)
| ~ apply(X8,esk8_2(X8,X9),esk8_2(X8,X9))
| pre_order(X8,X9) )
& ( member(esk10_2(X8,X9),X9)
| ~ apply(X8,esk8_2(X8,X9),esk8_2(X8,X9))
| pre_order(X8,X9) )
& ( member(esk11_2(X8,X9),X9)
| ~ apply(X8,esk8_2(X8,X9),esk8_2(X8,X9))
| pre_order(X8,X9) )
& ( apply(X8,esk9_2(X8,X9),esk10_2(X8,X9))
| ~ apply(X8,esk8_2(X8,X9),esk8_2(X8,X9))
| pre_order(X8,X9) )
& ( apply(X8,esk10_2(X8,X9),esk11_2(X8,X9))
| ~ apply(X8,esk8_2(X8,X9),esk8_2(X8,X9))
| pre_order(X8,X9) )
& ( ~ apply(X8,esk9_2(X8,X9),esk11_2(X8,X9))
| ~ apply(X8,esk8_2(X8,X9),esk8_2(X8,X9))
| pre_order(X8,X9) ) ),
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)],[pre_order])])])])])])]) ).
cnf(c_0_7,negated_conjecture,
( apply(esk2_0,esk5_0,X1)
| ~ apply(esk3_0,esk5_0,X1)
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,negated_conjecture,
member(esk7_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
apply(esk3_0,esk5_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,plain,
( apply(X1,X3,X4)
| ~ pre_order(X1,X2)
| ~ apply(X1,X5,X4)
| ~ apply(X1,X3,X5)
| ~ member(X4,X2)
| ~ member(X5,X2)
| ~ member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
apply(esk2_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
( apply(esk2_0,X1,X2)
| ~ member(X1,esk1_0)
| ~ member(X2,esk1_0)
| ~ apply(esk3_0,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,negated_conjecture,
member(esk4_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
apply(esk2_0,esk5_0,esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_15,negated_conjecture,
( apply(esk2_0,X1,esk5_0)
| ~ pre_order(esk2_0,X2)
| ~ apply(esk2_0,X1,esk4_0)
| ~ member(esk4_0,X2)
| ~ member(esk5_0,X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
pre_order(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_17,negated_conjecture,
( apply(esk2_0,X1,esk4_0)
| ~ apply(esk3_0,esk4_0,X1)
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
member(esk6_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_19,negated_conjecture,
apply(esk3_0,esk4_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_20,negated_conjecture,
( apply(esk2_0,X1,esk7_0)
| ~ pre_order(esk2_0,X2)
| ~ apply(esk2_0,X1,esk5_0)
| ~ member(esk5_0,X2)
| ~ member(esk7_0,X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
( apply(esk2_0,X1,esk5_0)
| ~ apply(esk2_0,X1,esk4_0)
| ~ member(X1,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_13]),c_0_5])]) ).
cnf(c_0_22,negated_conjecture,
apply(esk2_0,esk6_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_23,negated_conjecture,
( apply(esk2_0,X1,esk7_0)
| ~ apply(esk2_0,X1,esk5_0)
| ~ member(X1,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_16]),c_0_5]),c_0_8])]) ).
cnf(c_0_24,negated_conjecture,
apply(esk2_0,esk6_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_18]),c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
~ apply(esk2_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_18]),c_0_24])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET776+4 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 09:00:57 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.016 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 27
% 0.22/1.41 # Proof object clause steps : 22
% 0.22/1.41 # Proof object formula steps : 5
% 0.22/1.41 # Proof object conjectures : 24
% 0.22/1.41 # Proof object clause conjectures : 21
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 12
% 0.22/1.41 # Proof object initial formulas used : 2
% 0.22/1.41 # Proof object generating inferences : 10
% 0.22/1.41 # Proof object simplifying inferences : 15
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 17
% 0.22/1.41 # Removed by relevancy pruning/SinE : 15
% 0.22/1.41 # Initial clauses : 26
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 26
% 0.22/1.41 # Processed clauses : 132
% 0.22/1.41 # ...of these trivial : 2
% 0.22/1.41 # ...subsumed : 14
% 0.22/1.41 # ...remaining for further processing : 116
% 0.22/1.41 # Other redundant clauses eliminated : 0
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 2
% 0.22/1.41 # Backward-rewritten : 0
% 0.22/1.41 # Generated clauses : 405
% 0.22/1.41 # ...of the previous two non-trivial : 345
% 0.22/1.41 # Contextual simplify-reflections : 3
% 0.22/1.41 # Paramodulations : 405
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 0
% 0.22/1.41 # Current number of processed clauses : 114
% 0.22/1.41 # Positive orientable unit clauses : 23
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 3
% 0.22/1.41 # Non-unit-clauses : 88
% 0.22/1.41 # Current number of unprocessed clauses: 236
% 0.22/1.41 # ...number of literals in the above : 1176
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 2
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 1692
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 698
% 0.22/1.41 # Non-unit clause-clause subsumptions : 14
% 0.22/1.41 # Unit Clause-clause subsumption calls : 67
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 33
% 0.22/1.41 # BW rewrite match successes : 1
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 10337
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.033 s
% 0.22/1.41 # System time : 0.003 s
% 0.22/1.41 # Total time : 0.036 s
% 0.22/1.41 # Maximum resident set size: 3280 pages
%------------------------------------------------------------------------------