TSTP Solution File: SWW374+1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SWW374+1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:11:48 EDT 2024
% Result : Theorem 3.61s 2.02s
% Output : CNFRefutation 3.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 14 unt; 0 def)
% Number of atoms : 60 ( 23 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 53 ( 26 ~; 18 |; 2 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-3 aty)
% Number of variables : 45 ( 3 sgn 27 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_WT__bodiesD,axiom,
! [X12,X13] :
( c_Com_OWT__bodies
=> ( hAPP(c_Com_Obody,X13) = hAPP(c_Option_Ooption_OSome(tc_Com_Ocom),X12)
=> hBOOL(hAPP(c_Com_OWT,X12)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.tSNxBwCcGA/E---3.1_12905.p',fact_WT__bodiesD) ).
fof(conj_1,hypothesis,
c_Com_OWT__bodies,
file('/export/starexec/sandbox2/tmp/tmp.tSNxBwCcGA/E---3.1_12905.p',conj_1) ).
fof(fact_WT_Oequations_I7_J,axiom,
! [X11] :
( hBOOL(hAPP(c_Com_OWT,c_Com_Ocom_OBODY(X11)))
<=> ? [X25] : hAPP(c_Com_Obody,X11) = hAPP(c_Option_Ooption_OSome(tc_Com_Ocom),X25) ),
file('/export/starexec/sandbox2/tmp/tmp.tSNxBwCcGA/E---3.1_12905.p',fact_WT_Oequations_I7_J) ).
fof(fact_the_Osimps,axiom,
! [X24,X5] : hAPP(c_Option_Othe(X5),hAPP(c_Option_Ooption_OSome(X5),X24)) = X24,
file('/export/starexec/sandbox2/tmp/tmp.tSNxBwCcGA/E---3.1_12905.p',fact_the_Osimps) ).
fof(conj_4,conjecture,
hBOOL(hAPP(c_Com_OWT,hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,v_pn)))),
file('/export/starexec/sandbox2/tmp/tmp.tSNxBwCcGA/E---3.1_12905.p',conj_4) ).
fof(fact_domIff,axiom,
! [X23,X22,X11,X5] :
( hBOOL(hAPP(hAPP(c_member(X5),X11),c_Map_Odom(X5,X22,X23)))
<=> hAPP(X23,X11) != c_Option_Ooption_ONone(X22) ),
file('/export/starexec/sandbox2/tmp/tmp.tSNxBwCcGA/E---3.1_12905.p',fact_domIff) ).
fof(fact_WT_OBody,axiom,
! [X13] :
( hAPP(c_Com_Obody,X13) != c_Option_Ooption_ONone(tc_Com_Ocom)
=> hBOOL(hAPP(c_Com_OWT,c_Com_Ocom_OBODY(X13))) ),
file('/export/starexec/sandbox2/tmp/tmp.tSNxBwCcGA/E---3.1_12905.p',fact_WT_OBody) ).
fof(conj_3,hypothesis,
hBOOL(hAPP(hAPP(c_member(tc_Com_Opname),v_pn),c_Map_Odom(tc_Com_Opname,tc_Com_Ocom,c_Com_Obody))),
file('/export/starexec/sandbox2/tmp/tmp.tSNxBwCcGA/E---3.1_12905.p',conj_3) ).
fof(c_0_8,plain,
! [X325,X326] :
( ~ c_Com_OWT__bodies
| hAPP(c_Com_Obody,X326) != hAPP(c_Option_Ooption_OSome(tc_Com_Ocom),X325)
| hBOOL(hAPP(c_Com_OWT,X325)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_WT__bodiesD])])]) ).
cnf(c_0_9,plain,
( hBOOL(hAPP(c_Com_OWT,X2))
| ~ c_Com_OWT__bodies
| hAPP(c_Com_Obody,X1) != hAPP(c_Option_Ooption_OSome(tc_Com_Ocom),X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_10,hypothesis,
c_Com_OWT__bodies,
inference(split_conjunct,[status(thm)],[conj_1]) ).
fof(c_0_11,plain,
! [X473,X475,X476] :
( ( ~ hBOOL(hAPP(c_Com_OWT,c_Com_Ocom_OBODY(X473)))
| hAPP(c_Com_Obody,X473) = hAPP(c_Option_Ooption_OSome(tc_Com_Ocom),esk9_1(X473)) )
& ( hAPP(c_Com_Obody,X475) != hAPP(c_Option_Ooption_OSome(tc_Com_Ocom),X476)
| hBOOL(hAPP(c_Com_OWT,c_Com_Ocom_OBODY(X475))) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_WT_Oequations_I7_J])])])])])]) ).
cnf(c_0_12,plain,
( hBOOL(hAPP(c_Com_OWT,X1))
| hAPP(c_Com_Obody,X2) != hAPP(c_Option_Ooption_OSome(tc_Com_Ocom),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
cnf(c_0_13,plain,
( hAPP(c_Com_Obody,X1) = hAPP(c_Option_Ooption_OSome(tc_Com_Ocom),esk9_1(X1))
| ~ hBOOL(hAPP(c_Com_OWT,c_Com_Ocom_OBODY(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X555,X556] : hAPP(c_Option_Othe(X556),hAPP(c_Option_Ooption_OSome(X556),X555)) = X555,
inference(variable_rename,[status(thm)],[fact_the_Osimps]) ).
fof(c_0_15,negated_conjecture,
~ hBOOL(hAPP(c_Com_OWT,hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,v_pn)))),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_4])]) ).
cnf(c_0_16,plain,
( hBOOL(hAPP(c_Com_OWT,esk9_1(X1)))
| hAPP(c_Com_Obody,X2) != hAPP(c_Com_Obody,X1)
| ~ hBOOL(hAPP(c_Com_OWT,c_Com_Ocom_OBODY(X1))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
hAPP(c_Option_Othe(X1),hAPP(c_Option_Ooption_OSome(X1),X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X23,X22,X11,X5] :
( hBOOL(hAPP(hAPP(c_member(X5),X11),c_Map_Odom(X5,X22,X23)))
<=> hAPP(X23,X11) != c_Option_Ooption_ONone(X22) ),
inference(fof_simplification,[status(thm)],[fact_domIff]) ).
fof(c_0_19,negated_conjecture,
~ hBOOL(hAPP(c_Com_OWT,hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,v_pn)))),
inference(fof_nnf,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( hBOOL(hAPP(c_Com_OWT,esk9_1(X1)))
| ~ hBOOL(hAPP(c_Com_OWT,c_Com_Ocom_OBODY(X1))) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( esk9_1(X1) = hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,X1))
| ~ hBOOL(hAPP(c_Com_OWT,c_Com_Ocom_OBODY(X1))) ),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
fof(c_0_22,plain,
! [X13] :
( hAPP(c_Com_Obody,X13) != c_Option_Ooption_ONone(tc_Com_Ocom)
=> hBOOL(hAPP(c_Com_OWT,c_Com_Ocom_OBODY(X13))) ),
inference(fof_simplification,[status(thm)],[fact_WT_OBody]) ).
fof(c_0_23,plain,
! [X381,X382,X383,X384] :
( ( ~ hBOOL(hAPP(hAPP(c_member(X384),X383),c_Map_Odom(X384,X382,X381)))
| hAPP(X381,X383) != c_Option_Ooption_ONone(X382) )
& ( hAPP(X381,X383) = c_Option_Ooption_ONone(X382)
| hBOOL(hAPP(hAPP(c_member(X384),X383),c_Map_Odom(X384,X382,X381))) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])]) ).
cnf(c_0_24,negated_conjecture,
~ hBOOL(hAPP(c_Com_OWT,hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,v_pn)))),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( hBOOL(hAPP(c_Com_OWT,hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,X1))))
| ~ hBOOL(hAPP(c_Com_OWT,c_Com_Ocom_OBODY(X1))) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_26,plain,
! [X479] :
( hAPP(c_Com_Obody,X479) = c_Option_Ooption_ONone(tc_Com_Ocom)
| hBOOL(hAPP(c_Com_OWT,c_Com_Ocom_OBODY(X479))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])]) ).
cnf(c_0_27,plain,
( ~ hBOOL(hAPP(hAPP(c_member(X1),X2),c_Map_Odom(X1,X3,X4)))
| hAPP(X4,X2) != c_Option_Ooption_ONone(X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,hypothesis,
hBOOL(hAPP(hAPP(c_member(tc_Com_Opname),v_pn),c_Map_Odom(tc_Com_Opname,tc_Com_Ocom,c_Com_Obody))),
inference(split_conjunct,[status(thm)],[conj_3]) ).
cnf(c_0_29,negated_conjecture,
~ hBOOL(hAPP(c_Com_OWT,c_Com_Ocom_OBODY(v_pn))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
( hAPP(c_Com_Obody,X1) = c_Option_Ooption_ONone(tc_Com_Ocom)
| hBOOL(hAPP(c_Com_OWT,c_Com_Ocom_OBODY(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,hypothesis,
c_Option_Ooption_ONone(tc_Com_Ocom) != hAPP(c_Com_Obody,v_pn),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWW374+1 : TPTP v8.2.0. Released v5.2.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n016.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 07:33:39 EDT 2024
% 0.12/0.34 % CPUTime :
% 1.09/1.24 Running first-order theorem proving
% 1.09/1.24 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.tSNxBwCcGA/E---3.1_12905.p
% 3.61/2.02 # Version: 3.2.0
% 3.61/2.02 # Preprocessing class: FMLMSLSMSSSNFFN.
% 3.61/2.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.61/2.02 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 3.61/2.02 # Starting new_bool_3 with 300s (1) cores
% 3.61/2.02 # Starting new_bool_1 with 300s (1) cores
% 3.61/2.02 # Starting sh5l with 300s (1) cores
% 3.61/2.02 # new_bool_1 with pid 12986 completed with status 0
% 3.61/2.02 # Result found by new_bool_1
% 3.61/2.02 # Preprocessing class: FMLMSLSMSSSNFFN.
% 3.61/2.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.61/2.02 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 3.61/2.02 # Starting new_bool_3 with 300s (1) cores
% 3.61/2.02 # Starting new_bool_1 with 300s (1) cores
% 3.61/2.02 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.61/2.02 # Search class: FGHSM-SMLM33-DFFFFFNN
% 3.61/2.02 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 3.61/2.02 # Starting SAT001_MinMin_p005000_rr with 163s (1) cores
% 3.61/2.02 # SAT001_MinMin_p005000_rr with pid 12989 completed with status 0
% 3.61/2.02 # Result found by SAT001_MinMin_p005000_rr
% 3.61/2.02 # Preprocessing class: FMLMSLSMSSSNFFN.
% 3.61/2.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.61/2.02 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 3.61/2.02 # Starting new_bool_3 with 300s (1) cores
% 3.61/2.02 # Starting new_bool_1 with 300s (1) cores
% 3.61/2.02 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.61/2.02 # Search class: FGHSM-SMLM33-DFFFFFNN
% 3.61/2.02 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 3.61/2.02 # Starting SAT001_MinMin_p005000_rr with 163s (1) cores
% 3.61/2.02 # Preprocessing time : 0.059 s
% 3.61/2.02 # Presaturation interreduction done
% 3.61/2.02
% 3.61/2.02 # Proof found!
% 3.61/2.02 # SZS status Theorem
% 3.61/2.02 # SZS output start CNFRefutation
% See solution above
% 3.61/2.02 # Parsed axioms : 5249
% 3.61/2.02 # Removed by relevancy pruning/SinE : 3400
% 3.61/2.02 # Initial clauses : 2739
% 3.61/2.02 # Removed in clause preprocessing : 88
% 3.61/2.02 # Initial clauses in saturation : 2651
% 3.61/2.02 # Processed clauses : 3094
% 3.61/2.02 # ...of these trivial : 125
% 3.61/2.02 # ...subsumed : 510
% 3.61/2.02 # ...remaining for further processing : 2459
% 3.61/2.02 # Other redundant clauses eliminated : 265
% 3.61/2.02 # Clauses deleted for lack of memory : 0
% 3.61/2.02 # Backward-subsumed : 6
% 3.61/2.02 # Backward-rewritten : 60
% 3.61/2.02 # Generated clauses : 387
% 3.61/2.02 # ...of the previous two non-redundant : 258
% 3.61/2.02 # ...aggressively subsumed : 0
% 3.61/2.02 # Contextual simplify-reflections : 9
% 3.61/2.02 # Paramodulations : 136
% 3.61/2.02 # Factorizations : 0
% 3.61/2.02 # NegExts : 0
% 3.61/2.02 # Equation resolutions : 286
% 3.61/2.02 # Disequality decompositions : 0
% 3.61/2.02 # Total rewrite steps : 2318
% 3.61/2.02 # ...of those cached : 1772
% 3.61/2.02 # Propositional unsat checks : 0
% 3.61/2.02 # Propositional check models : 0
% 3.61/2.02 # Propositional check unsatisfiable : 0
% 3.61/2.02 # Propositional clauses : 0
% 3.61/2.02 # Propositional clauses after purity: 0
% 3.61/2.02 # Propositional unsat core size : 0
% 3.61/2.02 # Propositional preprocessing time : 0.000
% 3.61/2.02 # Propositional encoding time : 0.000
% 3.61/2.02 # Propositional solver time : 0.000
% 3.61/2.02 # Success case prop preproc time : 0.000
% 3.61/2.02 # Success case prop encoding time : 0.000
% 3.61/2.02 # Success case prop solver time : 0.000
% 3.61/2.02 # Current number of processed clauses : 249
% 3.61/2.02 # Positive orientable unit clauses : 99
% 3.61/2.02 # Positive unorientable unit clauses: 0
% 3.61/2.02 # Negative unit clauses : 68
% 3.61/2.02 # Non-unit-clauses : 82
% 3.61/2.02 # Current number of unprocessed clauses: 1732
% 3.61/2.02 # ...number of literals in the above : 3892
% 3.61/2.02 # Current number of archived formulas : 0
% 3.61/2.02 # Current number of archived clauses : 1983
% 3.61/2.02 # Clause-clause subsumption calls (NU) : 312526
% 3.61/2.02 # Rec. Clause-clause subsumption calls : 193102
% 3.61/2.02 # Non-unit clause-clause subsumptions : 436
% 3.61/2.02 # Unit Clause-clause subsumption calls : 4196
% 3.61/2.02 # Rewrite failures with RHS unbound : 83
% 3.61/2.02 # BW rewrite match attempts : 7651
% 3.61/2.02 # BW rewrite match successes : 228
% 3.61/2.02 # Condensation attempts : 0
% 3.61/2.02 # Condensation successes : 0
% 3.61/2.02 # Termbank termtop insertions : 460089
% 3.61/2.02 # Search garbage collected termcells : 66918
% 3.61/2.02
% 3.61/2.02 # -------------------------------------------------
% 3.61/2.02 # User time : 0.595 s
% 3.61/2.02 # System time : 0.037 s
% 3.61/2.02 # Total time : 0.632 s
% 3.61/2.02 # Maximum resident set size: 17356 pages
% 3.61/2.02
% 3.61/2.02 # -------------------------------------------------
% 3.61/2.02 # User time : 0.711 s
% 3.61/2.02 # System time : 0.048 s
% 3.61/2.02 # Total time : 0.759 s
% 3.61/2.02 # Maximum resident set size: 9496 pages
% 3.61/2.02 % E---3.1 exiting
% 3.61/2.02 % E exiting
%------------------------------------------------------------------------------