TSTP Solution File: SET793+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET793+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n012.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:24 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 8 unt; 0 def)
% Number of atoms : 110 ( 7 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 127 ( 44 ~; 54 |; 21 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 61 ( 9 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thIV5,conjecture,
! [X1,X2,X6] :
( ( total_order(X1,X2)
& max(X6,X1,X2) )
=> greatest(X6,X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thIV5) ).
fof(total_order,axiom,
! [X1,X2] :
( total_order(X1,X2)
<=> ( order(X1,X2)
& ! [X3,X4] :
( ( member(X3,X2)
& member(X4,X2) )
=> ( apply(X1,X3,X4)
| apply(X1,X4,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',total_order) ).
fof(max,axiom,
! [X1,X2,X6] :
( max(X6,X1,X2)
<=> ( member(X6,X2)
& ! [X3] :
( ( member(X3,X2)
& apply(X1,X6,X3) )
=> X6 = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',max) ).
fof(greatest,axiom,
! [X1,X2,X6] :
( greatest(X6,X1,X2)
<=> ( member(X6,X2)
& ! [X3] :
( member(X3,X2)
=> apply(X1,X3,X6) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',greatest) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X6] :
( ( total_order(X1,X2)
& max(X6,X1,X2) )
=> greatest(X6,X1,X2) ),
inference(assume_negation,[status(cth)],[thIV5]) ).
fof(c_0_5,plain,
! [X5,X6,X7,X8,X5,X6] :
( ( order(X5,X6)
| ~ total_order(X5,X6) )
& ( ~ member(X7,X6)
| ~ member(X8,X6)
| apply(X5,X7,X8)
| apply(X5,X8,X7)
| ~ total_order(X5,X6) )
& ( member(esk6_2(X5,X6),X6)
| ~ order(X5,X6)
| total_order(X5,X6) )
& ( member(esk7_2(X5,X6),X6)
| ~ order(X5,X6)
| total_order(X5,X6) )
& ( ~ apply(X5,esk6_2(X5,X6),esk7_2(X5,X6))
| ~ order(X5,X6)
| total_order(X5,X6) )
& ( ~ apply(X5,esk7_2(X5,X6),esk6_2(X5,X6))
| ~ order(X5,X6)
| total_order(X5,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)],[total_order])])])])])])]) ).
fof(c_0_6,negated_conjecture,
( total_order(esk1_0,esk2_0)
& max(esk3_0,esk1_0,esk2_0)
& ~ greatest(esk3_0,esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X7,X8,X9,X10,X7,X8,X9] :
( ( member(X9,X8)
| ~ max(X9,X7,X8) )
& ( ~ member(X10,X8)
| ~ apply(X7,X9,X10)
| X9 = X10
| ~ max(X9,X7,X8) )
& ( member(esk5_3(X7,X8,X9),X8)
| ~ member(X9,X8)
| max(X9,X7,X8) )
& ( apply(X7,X9,esk5_3(X7,X8,X9))
| ~ member(X9,X8)
| max(X9,X7,X8) )
& ( X9 != esk5_3(X7,X8,X9)
| ~ member(X9,X8)
| max(X9,X7,X8) ) ),
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)],[max])])])])])])]) ).
cnf(c_0_8,plain,
( apply(X1,X3,X4)
| apply(X1,X4,X3)
| ~ total_order(X1,X2)
| ~ member(X3,X2)
| ~ member(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
total_order(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( member(X1,X3)
| ~ max(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
max(esk3_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( apply(esk1_0,X1,X2)
| apply(esk1_0,X2,X1)
| ~ member(X1,esk2_0)
| ~ member(X2,esk2_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
member(esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_14,plain,
! [X7,X8,X9,X10,X7,X8,X9] :
( ( member(X9,X8)
| ~ greatest(X9,X7,X8) )
& ( ~ member(X10,X8)
| apply(X7,X10,X9)
| ~ greatest(X9,X7,X8) )
& ( member(esk4_3(X7,X8,X9),X8)
| ~ member(X9,X8)
| greatest(X9,X7,X8) )
& ( ~ apply(X7,esk4_3(X7,X8,X9),X9)
| ~ member(X9,X8)
| greatest(X9,X7,X8) ) ),
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)],[greatest])])])])])])]) ).
cnf(c_0_15,negated_conjecture,
( apply(esk1_0,X1,esk3_0)
| apply(esk1_0,esk3_0,X1)
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( greatest(X1,X2,X3)
| member(esk4_3(X2,X3,X1),X3)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,plain,
( X1 = X4
| ~ max(X1,X2,X3)
| ~ apply(X2,X1,X4)
| ~ member(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,plain,
( greatest(X1,X2,X3)
| ~ member(X1,X3)
| ~ apply(X2,esk4_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( greatest(X1,X2,esk2_0)
| apply(esk1_0,esk3_0,esk4_3(X2,esk2_0,X1))
| apply(esk1_0,esk4_3(X2,esk2_0,X1),esk3_0)
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
~ greatest(esk3_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_21,negated_conjecture,
( esk3_0 = X1
| ~ apply(esk1_0,esk3_0,X1)
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_11]) ).
cnf(c_0_22,negated_conjecture,
apply(esk1_0,esk3_0,esk4_3(esk1_0,esk2_0,esk3_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_13])]),c_0_20]) ).
cnf(c_0_23,negated_conjecture,
( esk4_3(esk1_0,esk2_0,esk3_0) = esk3_0
| ~ member(esk4_3(esk1_0,esk2_0,esk3_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
esk4_3(esk1_0,esk2_0,esk3_0) = esk3_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_16]),c_0_13])]),c_0_20]) ).
cnf(c_0_25,negated_conjecture,
apply(esk1_0,esk3_0,esk3_0),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_24]),c_0_25]),c_0_13])]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET793+4 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jul 10 02:08:43 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.018 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 27
% 0.25/1.43 # Proof object clause steps : 18
% 0.25/1.43 # Proof object formula steps : 9
% 0.25/1.43 # Proof object conjectures : 16
% 0.25/1.43 # Proof object clause conjectures : 13
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 8
% 0.25/1.43 # Proof object initial formulas used : 4
% 0.25/1.43 # Proof object generating inferences : 10
% 0.25/1.43 # Proof object simplifying inferences : 10
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 11
% 0.25/1.43 # Removed by relevancy pruning/SinE : 6
% 0.25/1.43 # Initial clauses : 83
% 0.25/1.43 # Removed in clause preprocessing : 0
% 0.25/1.43 # Initial clauses in saturation : 83
% 0.25/1.43 # Processed clauses : 121
% 0.25/1.43 # ...of these trivial : 0
% 0.25/1.43 # ...subsumed : 5
% 0.25/1.43 # ...remaining for further processing : 116
% 0.25/1.43 # Other redundant clauses eliminated : 0
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 1
% 0.25/1.43 # Backward-rewritten : 2
% 0.25/1.43 # Generated clauses : 378
% 0.25/1.43 # ...of the previous two non-trivial : 362
% 0.25/1.43 # Contextual simplify-reflections : 6
% 0.25/1.43 # Paramodulations : 378
% 0.25/1.43 # Factorizations : 0
% 0.25/1.43 # Equation resolutions : 0
% 0.25/1.43 # Current number of processed clauses : 113
% 0.25/1.43 # Positive orientable unit clauses : 6
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 1
% 0.25/1.43 # Non-unit-clauses : 106
% 0.25/1.43 # Current number of unprocessed clauses: 317
% 0.25/1.43 # ...number of literals in the above : 2322
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 3
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 2665
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 785
% 0.25/1.43 # Non-unit clause-clause subsumptions : 12
% 0.25/1.43 # Unit Clause-clause subsumption calls : 340
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 10
% 0.25/1.43 # BW rewrite match successes : 1
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 16195
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.032 s
% 0.25/1.43 # System time : 0.005 s
% 0.25/1.43 # Total time : 0.037 s
% 0.25/1.43 # Maximum resident set size: 3396 pages
%------------------------------------------------------------------------------