TSTP Solution File: SWW298+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWW298+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:09:02 EDT 2023
% Result : Theorem 3.30s 2.52s
% Output : CNFRefutation 3.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 4 unt; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 30 ( 13 ~; 10 |; 2 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 28 ( 2 sgn; 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_0,hypothesis,
! [X3] :
( hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),X3),v_ts))
=> c_Hoare__Mirabelle_Otriple__valid(t_a,hAPP(c_Nat_OSuc,v_n),X3) ),
file('/export/starexec/sandbox/tmp/tmp.NQrDczHnsL/E---3.1_13655.p',conj_0) ).
fof(fact_mem__def,axiom,
! [X40,X31,X9] :
( hBOOL(hAPP(hAPP(c_member(X9),X31),X40))
<=> hBOOL(hAPP(X40,X31)) ),
file('/export/starexec/sandbox/tmp/tmp.NQrDczHnsL/E---3.1_13655.p',fact_mem__def) ).
fof(conj_1,conjecture,
! [X3] :
( hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),X3),v_ts))
=> c_Hoare__Mirabelle_Otriple__valid(t_a,v_n,X3) ),
file('/export/starexec/sandbox/tmp/tmp.NQrDczHnsL/E---3.1_13655.p',conj_1) ).
fof(fact_triple__valid__Suc,axiom,
! [X4,X5,X6] :
( c_Hoare__Mirabelle_Otriple__valid(X6,hAPP(c_Nat_OSuc,X5),X4)
=> c_Hoare__Mirabelle_Otriple__valid(X6,X5,X4) ),
file('/export/starexec/sandbox/tmp/tmp.NQrDczHnsL/E---3.1_13655.p',fact_triple__valid__Suc) ).
fof(c_0_4,hypothesis,
! [X268] :
( ~ hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),X268),v_ts))
| c_Hoare__Mirabelle_Otriple__valid(t_a,hAPP(c_Nat_OSuc,v_n),X268) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_0])]) ).
fof(c_0_5,plain,
! [X436,X437,X438] :
( ( ~ hBOOL(hAPP(hAPP(c_member(X438),X437),X436))
| hBOOL(hAPP(X436,X437)) )
& ( ~ hBOOL(hAPP(X436,X437))
| hBOOL(hAPP(hAPP(c_member(X438),X437),X436)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_mem__def])]) ).
fof(c_0_6,negated_conjecture,
~ ! [X3] :
( hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),X3),v_ts))
=> c_Hoare__Mirabelle_Otriple__valid(t_a,v_n,X3) ),
inference(assume_negation,[status(cth)],[conj_1]) ).
fof(c_0_7,plain,
! [X270,X271,X272] :
( ~ c_Hoare__Mirabelle_Otriple__valid(X272,hAPP(c_Nat_OSuc,X271),X270)
| c_Hoare__Mirabelle_Otriple__valid(X272,X271,X270) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_triple__valid__Suc])]) ).
cnf(c_0_8,hypothesis,
( c_Hoare__Mirabelle_Otriple__valid(t_a,hAPP(c_Nat_OSuc,v_n),X1)
| ~ hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),X1),v_ts)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( hBOOL(hAPP(hAPP(c_member(X3),X2),X1))
| ~ hBOOL(hAPP(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_10,negated_conjecture,
( hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),esk1_0),v_ts))
& ~ c_Hoare__Mirabelle_Otriple__valid(t_a,v_n,esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_11,plain,
( c_Hoare__Mirabelle_Otriple__valid(X1,X2,X3)
| ~ c_Hoare__Mirabelle_Otriple__valid(X1,hAPP(c_Nat_OSuc,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
( c_Hoare__Mirabelle_Otriple__valid(t_a,hAPP(c_Nat_OSuc,v_n),X1)
| ~ hBOOL(hAPP(v_ts,X1)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( hBOOL(hAPP(X3,X2))
| ~ hBOOL(hAPP(hAPP(c_member(X1),X2),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),esk1_0),v_ts)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
~ c_Hoare__Mirabelle_Otriple__valid(t_a,v_n,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,hypothesis,
( c_Hoare__Mirabelle_Otriple__valid(t_a,v_n,X1)
| ~ hBOOL(hAPP(v_ts,X1)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
hBOOL(hAPP(v_ts,esk1_0)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.91/1.00 % Problem : SWW298+1 : TPTP v8.1.2. Released v5.2.0.
% 0.91/1.01 % Command : run_E %s %d THM
% 1.04/1.22 % Computer : n008.cluster.edu
% 1.04/1.22 % Model : x86_64 x86_64
% 1.04/1.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.04/1.22 % Memory : 8042.1875MB
% 1.04/1.22 % OS : Linux 3.10.0-693.el7.x86_64
% 1.04/1.22 % CPULimit : 2400
% 1.04/1.22 % WCLimit : 300
% 1.04/1.22 % DateTime : Mon Oct 2 22:24:14 EDT 2023
% 1.06/1.22 % CPUTime :
% 1.81/2.03 Running first-order theorem proving
% 1.81/2.03 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.NQrDczHnsL/E---3.1_13655.p
% 3.30/2.52 # Version: 3.1pre001
% 3.30/2.52 # Preprocessing class: FMLMSMSMSSSNFFN.
% 3.30/2.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.30/2.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.30/2.52 # Starting new_bool_3 with 300s (1) cores
% 3.30/2.52 # Starting new_bool_1 with 300s (1) cores
% 3.30/2.52 # Starting sh5l with 300s (1) cores
% 3.30/2.52 # new_bool_1 with pid 13735 completed with status 0
% 3.30/2.52 # Result found by new_bool_1
% 3.30/2.52 # Preprocessing class: FMLMSMSMSSSNFFN.
% 3.30/2.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.30/2.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.30/2.52 # Starting new_bool_3 with 300s (1) cores
% 3.30/2.52 # Starting new_bool_1 with 300s (1) cores
% 3.30/2.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.30/2.52 # Search class: FGHSM-FSLM32-DFFFFFNN
% 3.30/2.52 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 3.30/2.52 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 3.30/2.52 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 13737 completed with status 0
% 3.30/2.52 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 3.30/2.52 # Preprocessing class: FMLMSMSMSSSNFFN.
% 3.30/2.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.30/2.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.30/2.52 # Starting new_bool_3 with 300s (1) cores
% 3.30/2.52 # Starting new_bool_1 with 300s (1) cores
% 3.30/2.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.30/2.52 # Search class: FGHSM-FSLM32-DFFFFFNN
% 3.30/2.52 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 3.30/2.52 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 3.30/2.52 # Preprocessing time : 0.016 s
% 3.30/2.52
% 3.30/2.52 # Proof found!
% 3.30/2.52 # SZS status Theorem
% 3.30/2.52 # SZS output start CNFRefutation
% See solution above
% 3.30/2.52 # Parsed axioms : 5225
% 3.30/2.52 # Removed by relevancy pruning/SinE : 4641
% 3.30/2.52 # Initial clauses : 859
% 3.30/2.52 # Removed in clause preprocessing : 36
% 3.30/2.52 # Initial clauses in saturation : 823
% 3.30/2.52 # Processed clauses : 829
% 3.30/2.52 # ...of these trivial : 24
% 3.30/2.52 # ...subsumed : 170
% 3.30/2.52 # ...remaining for further processing : 635
% 3.30/2.52 # Other redundant clauses eliminated : 84
% 3.30/2.52 # Clauses deleted for lack of memory : 0
% 3.30/2.52 # Backward-subsumed : 4
% 3.30/2.52 # Backward-rewritten : 12
% 3.30/2.52 # Generated clauses : 12244
% 3.30/2.52 # ...of the previous two non-redundant : 10711
% 3.30/2.52 # ...aggressively subsumed : 0
% 3.30/2.52 # Contextual simplify-reflections : 4
% 3.30/2.52 # Paramodulations : 12127
% 3.30/2.52 # Factorizations : 8
% 3.30/2.52 # NegExts : 0
% 3.30/2.52 # Equation resolutions : 110
% 3.30/2.52 # Total rewrite steps : 4536
% 3.30/2.52 # Propositional unsat checks : 0
% 3.30/2.52 # Propositional check models : 0
% 3.30/2.52 # Propositional check unsatisfiable : 0
% 3.30/2.52 # Propositional clauses : 0
% 3.30/2.52 # Propositional clauses after purity: 0
% 3.30/2.52 # Propositional unsat core size : 0
% 3.30/2.52 # Propositional preprocessing time : 0.000
% 3.30/2.52 # Propositional encoding time : 0.000
% 3.30/2.52 # Propositional solver time : 0.000
% 3.30/2.52 # Success case prop preproc time : 0.000
% 3.30/2.52 # Success case prop encoding time : 0.000
% 3.30/2.52 # Success case prop solver time : 0.000
% 3.30/2.52 # Current number of processed clauses : 592
% 3.30/2.52 # Positive orientable unit clauses : 142
% 3.30/2.52 # Positive unorientable unit clauses: 16
% 3.30/2.52 # Negative unit clauses : 17
% 3.30/2.52 # Non-unit-clauses : 417
% 3.30/2.52 # Current number of unprocessed clauses: 10703
% 3.30/2.52 # ...number of literals in the above : 31031
% 3.30/2.52 # Current number of archived formulas : 0
% 3.30/2.52 # Current number of archived clauses : 16
% 3.30/2.52 # Clause-clause subsumption calls (NU) : 24276
% 3.30/2.52 # Rec. Clause-clause subsumption calls : 16518
% 3.30/2.52 # Non-unit clause-clause subsumptions : 156
% 3.30/2.52 # Unit Clause-clause subsumption calls : 380
% 3.30/2.52 # Rewrite failures with RHS unbound : 24
% 3.30/2.52 # BW rewrite match attempts : 2147
% 3.30/2.52 # BW rewrite match successes : 74
% 3.30/2.52 # Condensation attempts : 0
% 3.30/2.52 # Condensation successes : 0
% 3.30/2.52 # Termbank termtop insertions : 577761
% 3.30/2.52
% 3.30/2.52 # -------------------------------------------------
% 3.30/2.52 # User time : 0.324 s
% 3.30/2.52 # System time : 0.025 s
% 3.30/2.52 # Total time : 0.348 s
% 3.30/2.52 # Maximum resident set size: 11356 pages
% 3.30/2.52
% 3.30/2.52 # -------------------------------------------------
% 3.30/2.52 # User time : 0.446 s
% 3.30/2.52 # System time : 0.031 s
% 3.30/2.52 # Total time : 0.477 s
% 3.30/2.52 # Maximum resident set size: 9472 pages
% 3.30/2.52 % E---3.1 exiting
% 3.30/2.52 % E---3.1 exiting
%------------------------------------------------------------------------------