TSTP Solution File: SET017+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET017+1 : TPTP v8.1.0. Bugfixed v5.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 : Tue Jul 19 00:47:46 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 9 unt; 0 def)
% Number of atoms : 47 ( 22 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 44 ( 15 ~; 15 |; 11 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 24 ( 5 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(left_cancellation,conjecture,
! [X1,X2,X5] :
( ( member(X2,universal_class)
& member(X5,universal_class)
& unordered_pair(X1,X2) = unordered_pair(X1,X5) )
=> X2 = X5 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',left_cancellation) ).
fof(unordered_pair_defn,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( member(X3,universal_class)
& ( X3 = X1
| X3 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2,X5] :
( ( member(X2,universal_class)
& member(X5,universal_class)
& unordered_pair(X1,X2) = unordered_pair(X1,X5) )
=> X2 = X5 ),
inference(assume_negation,[status(cth)],[left_cancellation]) ).
fof(c_0_3,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( member(X4,universal_class)
| ~ member(X4,unordered_pair(X5,X6)) )
& ( X4 = X5
| X4 = X6
| ~ member(X4,unordered_pair(X5,X6)) )
& ( X4 != X5
| ~ member(X4,universal_class)
| member(X4,unordered_pair(X5,X6)) )
& ( X4 != X6
| ~ member(X4,universal_class)
| member(X4,unordered_pair(X5,X6)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair_defn])])])])]) ).
fof(c_0_4,negated_conjecture,
( member(esk2_0,universal_class)
& member(esk3_0,universal_class)
& unordered_pair(esk1_0,esk2_0) = unordered_pair(esk1_0,esk3_0)
& esk2_0 != esk3_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
cnf(c_0_5,plain,
( X1 = X3
| X1 = X2
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
unordered_pair(esk1_0,esk2_0) = unordered_pair(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( member(X1,unordered_pair(X2,X3))
| ~ member(X1,universal_class)
| X1 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
( X1 = esk2_0
| X1 = esk1_0
| ~ member(X1,unordered_pair(esk1_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
member(esk3_0,universal_class),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
esk2_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
esk3_0 = esk1_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),c_0_11]) ).
cnf(c_0_13,negated_conjecture,
unordered_pair(esk1_0,esk2_0) = unordered_pair(esk1_0,esk1_0),
inference(rw,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_14,negated_conjecture,
member(esk2_0,universal_class),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
member(esk2_0,unordered_pair(esk1_0,esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_13]),c_0_14])]) ).
cnf(c_0_16,negated_conjecture,
esk2_0 != esk1_0,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET017+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n019.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 16:58:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.014 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 18
% 0.22/1.40 # Proof object clause steps : 13
% 0.22/1.40 # Proof object formula steps : 5
% 0.22/1.40 # Proof object conjectures : 13
% 0.22/1.40 # Proof object clause conjectures : 10
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 6
% 0.22/1.40 # Proof object initial formulas used : 2
% 0.22/1.40 # Proof object generating inferences : 4
% 0.22/1.40 # Proof object simplifying inferences : 9
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 44
% 0.22/1.40 # Removed by relevancy pruning/SinE : 38
% 0.22/1.40 # Initial clauses : 14
% 0.22/1.40 # Removed in clause preprocessing : 2
% 0.22/1.40 # Initial clauses in saturation : 12
% 0.22/1.40 # Processed clauses : 22
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 1
% 0.22/1.40 # ...remaining for further processing : 21
% 0.22/1.40 # Other redundant clauses eliminated : 2
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 0
% 0.22/1.40 # Backward-rewritten : 4
% 0.22/1.40 # Generated clauses : 20
% 0.22/1.40 # ...of the previous two non-trivial : 15
% 0.22/1.40 # Contextual simplify-reflections : 0
% 0.22/1.40 # Paramodulations : 18
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 2
% 0.22/1.40 # Current number of processed clauses : 15
% 0.22/1.40 # Positive orientable unit clauses : 7
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 1
% 0.22/1.40 # Non-unit-clauses : 7
% 0.22/1.40 # Current number of unprocessed clauses: 3
% 0.22/1.40 # ...number of literals in the above : 8
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 6
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 6
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 6
% 0.22/1.40 # Non-unit clause-clause subsumptions : 1
% 0.22/1.40 # Unit Clause-clause subsumption calls : 0
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 1
% 0.22/1.40 # BW rewrite match successes : 1
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 1323
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.015 s
% 0.22/1.40 # System time : 0.001 s
% 0.22/1.40 # Total time : 0.016 s
% 0.22/1.40 # Maximum resident set size: 2780 pages
%------------------------------------------------------------------------------