TSTP Solution File: SWW469+1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SWW469+1 : TPTP v8.2.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 : 300s
% DateTime : Mon Jun 24 18:12:03 EDT 2024
% Result : Theorem 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 7 unt; 0 def)
% Number of atoms : 44 ( 12 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 47 ( 21 ~; 12 |; 8 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 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 : 12 ( 0 sgn 7 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_0_state__not__singleton__def,axiom,
( hoare_165779456gleton
<=> ? [X1,X2] :
( is_state(X1)
& is_state(X2)
& X1 != X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.F6imU2kji3/E---3.1_16036.p',fact_0_state__not__singleton__def) ).
fof(conj_1,conjecture,
! [X2] :
( is_state(X2)
=> ~ ! [X1] :
( is_state(X1)
=> X1 = X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.F6imU2kji3/E---3.1_16036.p',conj_1) ).
fof(conj_0,hypothesis,
hoare_165779456gleton,
file('/export/starexec/sandbox/tmp/tmp.F6imU2kji3/E---3.1_16036.p',conj_0) ).
fof(c_0_3,plain,
( hoare_165779456gleton
<=> ? [X1,X2] :
( is_state(X1)
& is_state(X2)
& X1 != X2 ) ),
inference(fof_simplification,[status(thm)],[fact_0_state__not__singleton__def]) ).
fof(c_0_4,plain,
! [X7,X8] :
( ( is_state(esk2_0)
| ~ hoare_165779456gleton )
& ( is_state(esk3_0)
| ~ hoare_165779456gleton )
& ( esk2_0 != esk3_0
| ~ hoare_165779456gleton )
& ( ~ is_state(X7)
| ~ is_state(X8)
| X7 = X8
| hoare_165779456gleton ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])]) ).
fof(c_0_5,negated_conjecture,
~ ! [X2] :
( is_state(X2)
=> ~ ! [X1] :
( is_state(X1)
=> X1 = X2 ) ),
inference(assume_negation,[status(cth)],[conj_1]) ).
cnf(c_0_6,plain,
( esk2_0 != 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]) ).
fof(c_0_8,negated_conjecture,
! [X4] :
( is_state(esk1_0)
& ( ~ is_state(X4)
| X4 = esk1_0 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
cnf(c_0_9,plain,
esk3_0 != esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_10,negated_conjecture,
( X1 = esk1_0
| ~ is_state(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( is_state(esk3_0)
| ~ hoare_165779456gleton ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
( esk2_0 != esk1_0
| ~ is_state(esk3_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
is_state(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_7])]) ).
cnf(c_0_14,plain,
( is_state(esk2_0)
| ~ hoare_165779456gleton ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
esk2_0 != esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_16,plain,
is_state(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_7])]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_10]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : SWW469+1 : TPTP v8.2.0. Released v5.3.0.
% 0.09/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Jun 19 04:49:24 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.22/0.52 Running first-order theorem proving
% 0.22/0.52 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.F6imU2kji3/E---3.1_16036.p
% 0.22/0.53 # Version: 3.2.0
% 0.22/0.53 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # new_bool_1 with pid 16116 completed with status 0
% 0.22/0.53 # Result found by new_bool_1
% 0.22/0.53 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.53 # Search class: FGHSF-FFSF00-SFFFFFNN
% 0.22/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mA with 181s (1) cores
% 0.22/0.53 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mA with pid 16119 completed with status 0
% 0.22/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mA
% 0.22/0.53 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.53 # Search class: FGHSF-FFSF00-SFFFFFNN
% 0.22/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mA with 181s (1) cores
% 0.22/0.53 # Preprocessing time : 0.001 s
% 0.22/0.53 # Presaturation interreduction done
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Theorem
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 7
% 0.22/0.53 # Removed by relevancy pruning/SinE : 4
% 0.22/0.53 # Initial clauses : 7
% 0.22/0.53 # Removed in clause preprocessing : 0
% 0.22/0.53 # Initial clauses in saturation : 7
% 0.22/0.53 # Processed clauses : 15
% 0.22/0.53 # ...of these trivial : 1
% 0.22/0.53 # ...subsumed : 0
% 0.22/0.53 # ...remaining for further processing : 14
% 0.22/0.53 # Other redundant clauses eliminated : 0
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 0
% 0.22/0.53 # Backward-rewritten : 1
% 0.22/0.53 # Generated clauses : 9
% 0.22/0.53 # ...of the previous two non-redundant : 5
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 0
% 0.22/0.53 # Paramodulations : 9
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 0
% 0.22/0.53 # Disequality decompositions : 0
% 0.22/0.53 # Total rewrite steps : 13
% 0.22/0.53 # ...of those cached : 9
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 7
% 0.22/0.53 # Positive orientable unit clauses : 4
% 0.22/0.53 # Positive unorientable unit clauses: 0
% 0.22/0.53 # Negative unit clauses : 2
% 0.22/0.53 # Non-unit-clauses : 1
% 0.22/0.53 # Current number of unprocessed clauses: 3
% 0.22/0.53 # ...number of literals in the above : 7
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 7
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 1
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 1
% 0.22/0.53 # Non-unit clause-clause subsumptions : 0
% 0.22/0.53 # Unit Clause-clause subsumption calls : 1
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 1
% 0.22/0.53 # BW rewrite match successes : 1
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 359
% 0.22/0.53 # Search garbage collected termcells : 119
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.002 s
% 0.22/0.53 # System time : 0.002 s
% 0.22/0.53 # Total time : 0.004 s
% 0.22/0.53 # Maximum resident set size: 1604 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.003 s
% 0.22/0.53 # System time : 0.004 s
% 0.22/0.53 # Total time : 0.008 s
% 0.22/0.53 # Maximum resident set size: 1672 pages
% 0.22/0.53 % E---3.1 exiting
% 0.22/0.53 % E exiting
%------------------------------------------------------------------------------