TSTP Solution File: SET813+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET813+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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:31 EDT 2022
% Result : Theorem 0.23s 1.40s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 4 unt; 0 def)
% Number of atoms : 38 ( 4 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 36 ( 14 ~; 12 |; 5 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 31 ( 8 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thV12,conjecture,
! [X1] :
( member(X1,on)
=> member(X1,suc(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thV12) ).
fof(successor,axiom,
! [X1,X3] :
( member(X3,suc(X1))
<=> member(X3,union(X1,singleton(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+4.ax',successor) ).
fof(singleton,axiom,
! [X3,X1] :
( member(X3,singleton(X1))
<=> X3 = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',singleton) ).
fof(union,axiom,
! [X3,X1,X2] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',union) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( member(X1,on)
=> member(X1,suc(X1)) ),
inference(assume_negation,[status(cth)],[thV12]) ).
fof(c_0_5,negated_conjecture,
( member(esk1_0,on)
& ~ member(esk1_0,suc(esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X4,X5,X4,X5] :
( ( ~ member(X5,suc(X4))
| member(X5,union(X4,singleton(X4))) )
& ( ~ member(X5,union(X4,singleton(X4)))
| member(X5,suc(X4)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[successor])])])]) ).
fof(c_0_7,plain,
! [X4,X5,X4,X5] :
( ( ~ member(X4,singleton(X5))
| X4 = X5 )
& ( X4 != X5
| member(X4,singleton(X5)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[singleton])])])]) ).
cnf(c_0_8,negated_conjecture,
~ member(esk1_0,suc(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( member(X1,suc(X2))
| ~ member(X1,union(X2,singleton(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( ~ member(X4,union(X5,X6))
| member(X4,X5)
| member(X4,X6) )
& ( ~ member(X4,X5)
| member(X4,union(X5,X6)) )
& ( ~ member(X4,X6)
| member(X4,union(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)],[union])])])])]) ).
cnf(c_0_11,plain,
( member(X1,singleton(X2))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
~ member(esk1_0,union(esk1_0,singleton(esk1_0))),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
member(X1,singleton(X1)),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET813+4 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n009.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:31:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.40 # Preprocessing time : 0.018 s
% 0.23/1.40
% 0.23/1.40 # Proof found!
% 0.23/1.40 # SZS status Theorem
% 0.23/1.40 # SZS output start CNFRefutation
% See solution above
% 0.23/1.40 # Proof object total steps : 16
% 0.23/1.40 # Proof object clause steps : 7
% 0.23/1.40 # Proof object formula steps : 9
% 0.23/1.40 # Proof object conjectures : 6
% 0.23/1.40 # Proof object clause conjectures : 3
% 0.23/1.40 # Proof object formula conjectures : 3
% 0.23/1.40 # Proof object initial clauses used : 4
% 0.23/1.40 # Proof object initial formulas used : 4
% 0.23/1.40 # Proof object generating inferences : 2
% 0.23/1.40 # Proof object simplifying inferences : 3
% 0.23/1.40 # Training examples: 0 positive, 0 negative
% 0.23/1.40 # Parsed axioms : 20
% 0.23/1.40 # Removed by relevancy pruning/SinE : 9
% 0.23/1.40 # Initial clauses : 56
% 0.23/1.40 # Removed in clause preprocessing : 0
% 0.23/1.40 # Initial clauses in saturation : 56
% 0.23/1.40 # Processed clauses : 63
% 0.23/1.40 # ...of these trivial : 0
% 0.23/1.40 # ...subsumed : 0
% 0.23/1.40 # ...remaining for further processing : 62
% 0.23/1.40 # Other redundant clauses eliminated : 1
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 0
% 0.23/1.40 # Backward-rewritten : 0
% 0.23/1.40 # Generated clauses : 136
% 0.23/1.40 # ...of the previous two non-trivial : 130
% 0.23/1.40 # Contextual simplify-reflections : 0
% 0.23/1.40 # Paramodulations : 135
% 0.23/1.40 # Factorizations : 0
% 0.23/1.40 # Equation resolutions : 1
% 0.23/1.40 # Current number of processed clauses : 61
% 0.23/1.40 # Positive orientable unit clauses : 3
% 0.23/1.40 # Positive unorientable unit clauses: 0
% 0.23/1.40 # Negative unit clauses : 2
% 0.23/1.40 # Non-unit-clauses : 56
% 0.23/1.40 # Current number of unprocessed clauses: 123
% 0.23/1.40 # ...number of literals in the above : 500
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 0
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 509
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 344
% 0.23/1.40 # Non-unit clause-clause subsumptions : 0
% 0.23/1.40 # Unit Clause-clause subsumption calls : 49
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 5
% 0.23/1.40 # BW rewrite match successes : 0
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 5271
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.020 s
% 0.23/1.40 # System time : 0.003 s
% 0.23/1.40 # Total time : 0.023 s
% 0.23/1.40 # Maximum resident set size: 3092 pages
%------------------------------------------------------------------------------