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 : n020.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.82s 0.99s
% Output : CNFRefutation 0.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 17 ( 9 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 15 ( 9 ~; 3 |; 1 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 12 ( 0 sgn 8 !; 4 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
state: $tType ).
tff(decl_24,type,
hoare_1310879719gleton: $o ).
tff(decl_25,type,
esk1_0: state ).
tff(decl_26,type,
esk2_0: state ).
tff(decl_27,type,
esk3_0: state ).
tff(fact_0_state__not__singleton__def,axiom,
( hoare_1310879719gleton
<=> ? [X1: state,X2: state] : ( X1 != X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.7c1hja98zq/E---3.1_21449.p',fact_0_state__not__singleton__def) ).
tff(conj_1,conjecture,
! [X2: state] :
~ ! [X1: state] : ( X1 = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.7c1hja98zq/E---3.1_21449.p',conj_1) ).
fof(conj_0,hypothesis,
hoare_1310879719gleton,
file('/export/starexec/sandbox2/tmp/tmp.7c1hja98zq/E---3.1_21449.p',conj_0) ).
tff(c_0_3,plain,
( hoare_1310879719gleton
<=> ? [X1: state,X2: state] : ( X1 != X2 ) ),
inference(fof_simplification,[status(thm)],[fact_0_state__not__singleton__def]) ).
tff(c_0_4,negated_conjecture,
~ ! [X2: state] :
~ ! [X1: state] : ( X1 = X2 ),
inference(assume_negation,[status(cth)],[conj_1]) ).
tff(c_0_5,plain,
! [X5: state,X6: state] :
( ( ~ hoare_1310879719gleton
| ( esk1_0 != esk2_0 ) )
& ( ( X5 = X6 )
| hoare_1310879719gleton ) ),
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])])])])]) ).
tff(c_0_6,negated_conjecture,
! [X8: state] : ( X8 = esk3_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
tcf(c_0_7,plain,
( ~ hoare_1310879719gleton
| ( esk1_0 != esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_8,negated_conjecture,
! [X1: state] : X1 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,hypothesis,
hoare_1310879719gleton,
inference(split_conjunct,[status(thm)],[conj_0]) ).
cnf(c_0_10,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_8]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWW469_1 : TPTP v8.2.0. Released v5.3.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n020.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 : 300
% 0.12/0.34 % DateTime : Wed Jun 19 08:09:39 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.22/0.47 Running first-order theorem proving
% 0.22/0.47 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.7c1hja98zq/E---3.1_21449.p
% 0.82/0.99 # Version: 3.2.0
% 0.82/0.99 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.82/0.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.99 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.82/0.99 # Starting new_bool_3 with 300s (1) cores
% 0.82/0.99 # Starting new_bool_1 with 300s (1) cores
% 0.82/0.99 # Starting sh5l with 300s (1) cores
% 0.82/0.99 # SAT001_MinMin_p005000_rr_RG with pid 21528 completed with status 0
% 0.82/0.99 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.82/0.99 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.82/0.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.99 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.82/0.99 # No SInE strategy applied
% 0.82/0.99 # Search class: FGHSF-FFSS00-SFFFFFNN
% 0.82/0.99 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.82/0.99 # Starting SAT001_MinMin_p005000_rr_RG with 901s (1) cores
% 0.82/0.99 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 151s (1) cores
% 0.82/0.99 # Starting new_bool_3 with 151s (1) cores
% 0.82/0.99 # Starting new_bool_1 with 151s (1) cores
% 0.82/0.99 # Starting sh5l with 146s (1) cores
% 0.82/0.99 # SAT001_MinMin_p005000_rr_RG with pid 21534 completed with status 0
% 0.82/0.99 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.82/0.99 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.82/0.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.99 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.82/0.99 # No SInE strategy applied
% 0.82/0.99 # Search class: FGHSF-FFSS00-SFFFFFNN
% 0.82/0.99 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.82/0.99 # Starting SAT001_MinMin_p005000_rr_RG with 901s (1) cores
% 0.82/0.99 # Preprocessing time : 0.001 s
% 0.82/0.99 # Presaturation interreduction done
% 0.82/0.99
% 0.82/0.99 # Proof found!
% 0.82/0.99 # SZS status Theorem
% 0.82/0.99 # SZS output start CNFRefutation
% See solution above
% 0.82/0.99 # Parsed axioms : 10
% 0.82/0.99 # Removed by relevancy pruning/SinE : 0
% 0.82/0.99 # Initial clauses : 11
% 0.82/0.99 # Removed in clause preprocessing : 4
% 0.82/0.99 # Initial clauses in saturation : 7
% 0.82/0.99 # Processed clauses : 6
% 0.82/0.99 # ...of these trivial : 1
% 0.82/0.99 # ...subsumed : 0
% 0.82/0.99 # ...remaining for further processing : 4
% 0.82/0.99 # Other redundant clauses eliminated : 0
% 0.82/0.99 # Clauses deleted for lack of memory : 0
% 0.82/0.99 # Backward-subsumed : 0
% 0.82/0.99 # Backward-rewritten : 0
% 0.82/0.99 # Generated clauses : 0
% 0.82/0.99 # ...of the previous two non-redundant : 0
% 0.82/0.99 # ...aggressively subsumed : 0
% 0.82/0.99 # Contextual simplify-reflections : 0
% 0.82/0.99 # Paramodulations : 0
% 0.82/0.99 # Factorizations : 0
% 0.82/0.99 # NegExts : 0
% 0.82/0.99 # Equation resolutions : 0
% 0.82/0.99 # Disequality decompositions : 0
% 0.82/0.99 # Total rewrite steps : 4
% 0.82/0.99 # ...of those cached : 0
% 0.82/0.99 # Propositional unsat checks : 0
% 0.82/0.99 # Propositional check models : 0
% 0.82/0.99 # Propositional check unsatisfiable : 0
% 0.82/0.99 # Propositional clauses : 0
% 0.82/0.99 # Propositional clauses after purity: 0
% 0.82/0.99 # Propositional unsat core size : 0
% 0.82/0.99 # Propositional preprocessing time : 0.000
% 0.82/0.99 # Propositional encoding time : 0.000
% 0.82/0.99 # Propositional solver time : 0.000
% 0.82/0.99 # Success case prop preproc time : 0.000
% 0.82/0.99 # Success case prop encoding time : 0.000
% 0.82/0.99 # Success case prop solver time : 0.000
% 0.82/0.99 # Current number of processed clauses : 4
% 0.82/0.99 # Positive orientable unit clauses : 2
% 0.82/0.99 # Positive unorientable unit clauses: 1
% 0.82/0.99 # Negative unit clauses : 1
% 0.82/0.99 # Non-unit-clauses : 0
% 0.82/0.99 # Current number of unprocessed clauses: 1
% 0.82/0.99 # ...number of literals in the above : 2
% 0.82/0.99 # Current number of archived formulas : 0
% 0.82/0.99 # Current number of archived clauses : 0
% 0.82/0.99 # Clause-clause subsumption calls (NU) : 0
% 0.82/0.99 # Rec. Clause-clause subsumption calls : 0
% 0.82/0.99 # Non-unit clause-clause subsumptions : 0
% 0.82/0.99 # Unit Clause-clause subsumption calls : 0
% 0.82/0.99 # Rewrite failures with RHS unbound : 0
% 0.82/0.99 # BW rewrite match attempts : 0
% 0.82/0.99 # BW rewrite match successes : 0
% 0.82/0.99 # Condensation attempts : 0
% 0.82/0.99 # Condensation successes : 0
% 0.82/0.99 # Termbank termtop insertions : 195
% 0.82/0.99 # Search garbage collected termcells : 41
% 0.82/0.99
% 0.82/0.99 # -------------------------------------------------
% 0.82/0.99 # User time : 0.001 s
% 0.82/0.99 # System time : 0.002 s
% 0.82/0.99 # Total time : 0.003 s
% 0.82/0.99 # Maximum resident set size: 1672 pages
% 0.82/0.99
% 0.82/0.99 # -------------------------------------------------
% 0.82/0.99 # User time : 0.003 s
% 0.82/0.99 # System time : 0.008 s
% 0.82/0.99 # Total time : 0.011 s
% 0.82/0.99 # Maximum resident set size: 1688 pages
% 0.82/0.99 % E---3.1 exiting
% 0.82/0.99 % E exiting
%------------------------------------------------------------------------------