TSTP Solution File: SET804+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET804+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.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:28 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 10 unt; 0 def)
% Number of atoms : 79 ( 12 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 88 ( 33 ~; 29 |; 18 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 49 ( 8 sgn 30 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thIV16,conjecture,
! [X1,X2] :
( order(X1,X2)
=> ! [X8,X9] :
( ( min(X8,X1,X2)
& min(X9,X1,X2)
& X8 != X9 )
=> ~ ? [X6] : least(X6,X1,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thIV16) ).
fof(min,axiom,
! [X1,X2,X6] :
( min(X6,X1,X2)
<=> ( member(X6,X2)
& ! [X3] :
( ( member(X3,X2)
& apply(X1,X3,X6) )
=> X6 = X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+3.ax',min) ).
fof(least,axiom,
! [X1,X2,X6] :
( least(X6,X1,X2)
<=> ( member(X6,X2)
& ! [X3] :
( member(X3,X2)
=> apply(X1,X6,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+3.ax',least) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( order(X1,X2)
=> ! [X8,X9] :
( ( min(X8,X1,X2)
& min(X9,X1,X2)
& X8 != X9 )
=> ~ ? [X6] : least(X6,X1,X2) ) ),
inference(assume_negation,[status(cth)],[thIV16]) ).
fof(c_0_4,plain,
! [X7,X8,X9,X10,X7,X8,X9] :
( ( member(X9,X8)
| ~ min(X9,X7,X8) )
& ( ~ member(X10,X8)
| ~ apply(X7,X10,X9)
| X9 = X10
| ~ min(X9,X7,X8) )
& ( member(esk7_3(X7,X8,X9),X8)
| ~ member(X9,X8)
| min(X9,X7,X8) )
& ( apply(X7,esk7_3(X7,X8,X9),X9)
| ~ member(X9,X8)
| min(X9,X7,X8) )
& ( X9 != esk7_3(X7,X8,X9)
| ~ member(X9,X8)
| min(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)],[min])])])])])])]) ).
fof(c_0_5,negated_conjecture,
( order(esk1_0,esk2_0)
& min(esk3_0,esk1_0,esk2_0)
& min(esk4_0,esk1_0,esk2_0)
& esk3_0 != esk4_0
& least(esk5_0,esk1_0,esk2_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)],[c_0_3])])])])]) ).
fof(c_0_6,plain,
! [X7,X8,X9,X10,X7,X8,X9] :
( ( member(X9,X8)
| ~ least(X9,X7,X8) )
& ( ~ member(X10,X8)
| apply(X7,X9,X10)
| ~ least(X9,X7,X8) )
& ( member(esk6_3(X7,X8,X9),X8)
| ~ member(X9,X8)
| least(X9,X7,X8) )
& ( ~ apply(X7,X9,esk6_3(X7,X8,X9))
| ~ member(X9,X8)
| least(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)],[least])])])])])])]) ).
cnf(c_0_7,plain,
( X1 = X4
| ~ min(X1,X2,X3)
| ~ apply(X2,X4,X1)
| ~ member(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
min(esk4_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( apply(X2,X1,X4)
| ~ least(X1,X2,X3)
| ~ member(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
least(esk5_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( member(X1,X3)
| ~ least(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( member(X1,X3)
| ~ min(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
min(esk3_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
( esk4_0 = X1
| ~ apply(esk1_0,X1,esk4_0)
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_15,negated_conjecture,
( apply(esk1_0,esk5_0,X1)
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
member(esk5_0,esk2_0),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_17,negated_conjecture,
member(esk4_0,esk2_0),
inference(spm,[status(thm)],[c_0_12,c_0_8]) ).
cnf(c_0_18,negated_conjecture,
( esk3_0 = X1
| ~ apply(esk1_0,X1,esk3_0)
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
member(esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,negated_conjecture,
esk3_0 != esk4_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,negated_conjecture,
esk4_0 = esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_22,negated_conjecture,
esk3_0 = esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_15]),c_0_16]),c_0_19])]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET804+4 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 12:55:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.018 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 24
% 0.23/1.41 # Proof object clause steps : 17
% 0.23/1.41 # Proof object formula steps : 7
% 0.23/1.41 # Proof object conjectures : 16
% 0.23/1.41 # Proof object clause conjectures : 13
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 8
% 0.23/1.41 # Proof object initial formulas used : 3
% 0.23/1.41 # Proof object generating inferences : 8
% 0.23/1.41 # Proof object simplifying inferences : 9
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 11
% 0.23/1.41 # Removed by relevancy pruning/SinE : 7
% 0.23/1.41 # Initial clauses : 79
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 79
% 0.23/1.41 # Processed clauses : 91
% 0.23/1.41 # ...of these trivial : 1
% 0.23/1.41 # ...subsumed : 0
% 0.23/1.41 # ...remaining for further processing : 89
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 7
% 0.23/1.41 # Generated clauses : 60
% 0.23/1.41 # ...of the previous two non-trivial : 63
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 60
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 82
% 0.23/1.41 # Positive orientable unit clauses : 7
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 0
% 0.23/1.41 # Non-unit-clauses : 75
% 0.23/1.41 # Current number of unprocessed clauses: 49
% 0.23/1.41 # ...number of literals in the above : 382
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 7
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 1272
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 583
% 0.23/1.41 # Non-unit clause-clause subsumptions : 0
% 0.23/1.41 # Unit Clause-clause subsumption calls : 484
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 2
% 0.23/1.41 # BW rewrite match successes : 2
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 6090
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.020 s
% 0.23/1.41 # System time : 0.005 s
% 0.23/1.41 # Total time : 0.025 s
% 0.23/1.41 # Maximum resident set size: 3120 pages
%------------------------------------------------------------------------------