TSTP Solution File: SWW469+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWW469+1 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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 : Thu Jul 21 00:10:51 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 7 unt; 0 def)
% Number of atoms : 38 ( 10 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 38 ( 16 ~; 11 |; 6 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 10 ( 0 sgn 7 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_1,conjecture,
! [X2] :
( is_state(X2)
=> ~ ! [X1] :
( is_state(X1)
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj_1) ).
fof(fact_0_state__not__singleton__def,axiom,
( hoare_165779456gleton
<=> ? [X1,X2] :
( is_state(X1)
& is_state(X2)
& X1 != X2 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_0_state__not__singleton__def) ).
fof(conj_0,hypothesis,
hoare_165779456gleton,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj_0) ).
fof(c_0_3,negated_conjecture,
~ ! [X2] :
( is_state(X2)
=> ~ ! [X1] :
( is_state(X1)
=> X1 = X2 ) ),
inference(assume_negation,[status(cth)],[conj_1]) ).
fof(c_0_4,plain,
! [X5,X6] :
( ( is_state(esk2_0)
| ~ hoare_165779456gleton )
& ( is_state(esk3_0)
| ~ hoare_165779456gleton )
& ( esk2_0 != esk3_0
| ~ hoare_165779456gleton )
& ( ~ is_state(X5)
| ~ is_state(X6)
| X5 = X6
| hoare_165779456gleton ) ),
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)],[fact_0_state__not__singleton__def])])])])])])]) ).
fof(c_0_5,negated_conjecture,
! [X4] :
( is_state(esk1_0)
& ( ~ is_state(X4)
| X4 = esk1_0 ) ),
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_3])])])])])]) ).
cnf(c_0_6,plain,
( is_state(esk3_0)
| ~ hoare_165779456gleton ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
hoare_165779456gleton,
inference(split_conjunct,[status(thm)],[conj_0]) ).
cnf(c_0_8,plain,
( is_state(esk2_0)
| ~ hoare_165779456gleton ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
( X1 = esk1_0
| ~ is_state(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
is_state(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_11,plain,
is_state(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7])]) ).
cnf(c_0_12,plain,
( ~ hoare_165779456gleton
| esk2_0 != esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
esk3_0 = esk1_0,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
esk2_0 = esk1_0,
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_15,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_7])]),c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWW469+1 : TPTP v8.1.0. Released v5.3.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n017.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 : Sat Jun 4 11:33:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.013 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 16
% 0.23/1.42 # Proof object clause steps : 10
% 0.23/1.42 # Proof object formula steps : 6
% 0.23/1.42 # Proof object conjectures : 6
% 0.23/1.42 # Proof object clause conjectures : 3
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 5
% 0.23/1.42 # Proof object initial formulas used : 3
% 0.23/1.42 # Proof object generating inferences : 2
% 0.23/1.42 # Proof object simplifying inferences : 9
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 7
% 0.23/1.42 # Removed by relevancy pruning/SinE : 4
% 0.23/1.42 # Initial clauses : 7
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 7
% 0.23/1.42 # Processed clauses : 10
% 0.23/1.42 # ...of these trivial : 1
% 0.23/1.42 # ...subsumed : 0
% 0.23/1.42 # ...remaining for further processing : 8
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 3
% 0.23/1.42 # Generated clauses : 2
% 0.23/1.42 # ...of the previous two non-trivial : 3
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 2
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 5
% 0.23/1.42 # Positive orientable unit clauses : 4
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 0
% 0.23/1.42 # Non-unit-clauses : 1
% 0.23/1.42 # Current number of unprocessed clauses: 0
% 0.23/1.42 # ...number of literals in the above : 0
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 3
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 0
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 0
% 0.23/1.42 # Non-unit clause-clause subsumptions : 0
% 0.23/1.42 # Unit Clause-clause subsumption calls : 0
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 3
% 0.23/1.42 # BW rewrite match successes : 3
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 316
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.011 s
% 0.23/1.42 # System time : 0.003 s
% 0.23/1.42 # Total time : 0.014 s
% 0.23/1.42 # Maximum resident set size: 2768 pages
%------------------------------------------------------------------------------