TSTP Solution File: SWW337+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWW337+1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 : Tue May 21 06:42:19 EDT 2024
% Result : Theorem 2.08s 1.11s
% Output : CNFRefutation 2.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 7 unt; 0 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 40 ( 16 ~; 12 |; 3 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 34 ( 3 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_1,conjecture,
! [X11] :
( ! [X3] :
( hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),X3),v_G))
=> c_Hoare__Mirabelle_Otriple__valid(t_a,X11,X3) )
=> ! [X3] :
( hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),X3),v_ts))
=> c_Hoare__Mirabelle_Otriple__valid(t_a,X11,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).
fof(fact_mem__def,axiom,
! [X5,X13,X6] :
( hBOOL(hAPP(hAPP(c_member(X6),X13),X5))
<=> hBOOL(hAPP(X5,X13)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_mem__def) ).
fof(fact_rev__predicate1D,axiom,
! [X14,X6,X13,X15] :
( hBOOL(hAPP(X15,X13))
=> ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X6,tc_HOL_Obool)),X15),X14))
=> hBOOL(hAPP(X14,X13)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_rev__predicate1D) ).
fof(conj_0,hypothesis,
hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool)),v_ts),v_G)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
fof(c_0_4,negated_conjecture,
~ ! [X11] :
( ! [X3] :
( hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),X3),v_G))
=> c_Hoare__Mirabelle_Otriple__valid(t_a,X11,X3) )
=> ! [X3] :
( hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),X3),v_ts))
=> c_Hoare__Mirabelle_Otriple__valid(t_a,X11,X3) ) ),
inference(assume_negation,[status(cth)],[conj_1]) ).
fof(c_0_5,negated_conjecture,
! [X285] :
( ( ~ hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),X285),v_G))
| c_Hoare__Mirabelle_Otriple__valid(t_a,esk1_0,X285) )
& hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),esk2_0),v_ts))
& ~ c_Hoare__Mirabelle_Otriple__valid(t_a,esk1_0,esk2_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_4])])])])]) ).
fof(c_0_6,plain,
! [X439,X440,X441] :
( ( ~ hBOOL(hAPP(hAPP(c_member(X441),X440),X439))
| hBOOL(hAPP(X439,X440)) )
& ( ~ hBOOL(hAPP(X439,X440))
| hBOOL(hAPP(hAPP(c_member(X441),X440),X439)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_mem__def])])]) ).
cnf(c_0_7,negated_conjecture,
( c_Hoare__Mirabelle_Otriple__valid(t_a,esk1_0,X1)
| ~ hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),X1),v_G)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( hBOOL(hAPP(hAPP(c_member(X3),X2),X1))
| ~ hBOOL(hAPP(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X298,X299,X300,X301] :
( ~ hBOOL(hAPP(X301,X300))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X299,tc_HOL_Obool)),X301),X298))
| hBOOL(hAPP(X298,X300)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_rev__predicate1D])])]) ).
cnf(c_0_10,negated_conjecture,
~ c_Hoare__Mirabelle_Otriple__valid(t_a,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
( c_Hoare__Mirabelle_Otriple__valid(t_a,esk1_0,X1)
| ~ hBOOL(hAPP(v_G,X1)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( hBOOL(hAPP(X4,X2))
| ~ hBOOL(hAPP(X1,X2))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X3,tc_HOL_Obool)),X1),X4)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,hypothesis,
hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool)),v_ts),v_G)),
inference(split_conjunct,[status(thm)],[conj_0]) ).
cnf(c_0_14,plain,
( hBOOL(hAPP(X3,X2))
| ~ hBOOL(hAPP(hAPP(c_member(X1),X2),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),esk2_0),v_ts)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
~ hBOOL(hAPP(v_G,esk2_0)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,hypothesis,
( hBOOL(hAPP(v_G,X1))
| ~ hBOOL(hAPP(v_ts,X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
hBOOL(hAPP(v_ts,esk2_0)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWW337+1 : TPTP v8.2.0. Released v5.2.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sat May 18 19:54:53 EDT 2024
% 0.20/0.34 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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/benchmark/theBenchmark.p
% 2.08/1.11 # Version: 3.1.0
% 2.08/1.11 # Preprocessing class: FMLMSMSMSSSNFFN.
% 2.08/1.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.08/1.11 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.08/1.11 # Starting new_bool_3 with 300s (1) cores
% 2.08/1.11 # Starting new_bool_1 with 300s (1) cores
% 2.08/1.11 # Starting sh5l with 300s (1) cores
% 2.08/1.11 # new_bool_3 with pid 12425 completed with status 0
% 2.08/1.11 # Result found by new_bool_3
% 2.08/1.11 # Preprocessing class: FMLMSMSMSSSNFFN.
% 2.08/1.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.08/1.11 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.08/1.11 # Starting new_bool_3 with 300s (1) cores
% 2.08/1.11 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.08/1.11 # Search class: FGHSM-FSLM32-DFFFFFNN
% 2.08/1.11 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 2.08/1.11 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 2.08/1.11 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 12429 completed with status 0
% 2.08/1.11 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 2.08/1.11 # Preprocessing class: FMLMSMSMSSSNFFN.
% 2.08/1.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.08/1.11 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.08/1.11 # Starting new_bool_3 with 300s (1) cores
% 2.08/1.11 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.08/1.11 # Search class: FGHSM-FSLM32-DFFFFFNN
% 2.08/1.11 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 2.08/1.11 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 2.08/1.11 # Preprocessing time : 0.028 s
% 2.08/1.11
% 2.08/1.11 # Proof found!
% 2.08/1.11 # SZS status Theorem
% 2.08/1.11 # SZS output start CNFRefutation
% See solution above
% 2.08/1.11 # Parsed axioms : 5226
% 2.08/1.11 # Removed by relevancy pruning/SinE : 4661
% 2.08/1.11 # Initial clauses : 838
% 2.08/1.11 # Removed in clause preprocessing : 34
% 2.08/1.11 # Initial clauses in saturation : 804
% 2.08/1.11 # Processed clauses : 817
% 2.08/1.11 # ...of these trivial : 23
% 2.08/1.11 # ...subsumed : 168
% 2.08/1.11 # ...remaining for further processing : 626
% 2.08/1.11 # Other redundant clauses eliminated : 126
% 2.08/1.11 # Clauses deleted for lack of memory : 0
% 2.08/1.11 # Backward-subsumed : 6
% 2.08/1.11 # Backward-rewritten : 11
% 2.08/1.11 # Generated clauses : 13883
% 2.08/1.11 # ...of the previous two non-redundant : 12274
% 2.08/1.11 # ...aggressively subsumed : 0
% 2.08/1.11 # Contextual simplify-reflections : 4
% 2.08/1.11 # Paramodulations : 13725
% 2.08/1.11 # Factorizations : 8
% 2.08/1.11 # NegExts : 0
% 2.08/1.11 # Equation resolutions : 151
% 2.08/1.11 # Disequality decompositions : 0
% 2.08/1.11 # Total rewrite steps : 4532
% 2.08/1.11 # ...of those cached : 3299
% 2.08/1.11 # Propositional unsat checks : 0
% 2.08/1.11 # Propositional check models : 0
% 2.08/1.11 # Propositional check unsatisfiable : 0
% 2.08/1.11 # Propositional clauses : 0
% 2.08/1.11 # Propositional clauses after purity: 0
% 2.08/1.11 # Propositional unsat core size : 0
% 2.08/1.11 # Propositional preprocessing time : 0.000
% 2.08/1.11 # Propositional encoding time : 0.000
% 2.08/1.11 # Propositional solver time : 0.000
% 2.08/1.11 # Success case prop preproc time : 0.000
% 2.08/1.11 # Success case prop encoding time : 0.000
% 2.08/1.11 # Success case prop solver time : 0.000
% 2.08/1.11 # Current number of processed clauses : 582
% 2.08/1.11 # Positive orientable unit clauses : 133
% 2.08/1.11 # Positive unorientable unit clauses: 15
% 2.08/1.11 # Negative unit clauses : 16
% 2.08/1.11 # Non-unit-clauses : 418
% 2.08/1.11 # Current number of unprocessed clauses: 12243
% 2.08/1.11 # ...number of literals in the above : 34796
% 2.08/1.11 # Current number of archived formulas : 0
% 2.08/1.11 # Current number of archived clauses : 17
% 2.08/1.11 # Clause-clause subsumption calls (NU) : 26214
% 2.08/1.11 # Rec. Clause-clause subsumption calls : 19621
% 2.08/1.11 # Non-unit clause-clause subsumptions : 156
% 2.08/1.11 # Unit Clause-clause subsumption calls : 1508
% 2.08/1.11 # Rewrite failures with RHS unbound : 26
% 2.08/1.11 # BW rewrite match attempts : 2395
% 2.08/1.11 # BW rewrite match successes : 75
% 2.08/1.11 # Condensation attempts : 0
% 2.08/1.11 # Condensation successes : 0
% 2.08/1.11 # Termbank termtop insertions : 631527
% 2.08/1.11 # Search garbage collected termcells : 55016
% 2.08/1.11
% 2.08/1.11 # -------------------------------------------------
% 2.08/1.11 # User time : 0.386 s
% 2.08/1.11 # System time : 0.039 s
% 2.08/1.11 # Total time : 0.425 s
% 2.08/1.11 # Maximum resident set size: 11224 pages
% 2.08/1.11
% 2.08/1.11 # -------------------------------------------------
% 2.08/1.11 # User time : 0.563 s
% 2.08/1.11 # System time : 0.054 s
% 2.08/1.11 # Total time : 0.617 s
% 2.08/1.11 # Maximum resident set size: 9428 pages
% 2.08/1.11 % E---3.1 exiting
% 2.08/1.11 % E exiting
%------------------------------------------------------------------------------