TSTP Solution File: SWW297+1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SWW297+1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:32 EDT 2024
% Result : Theorem 1.07s 1.64s
% Output : CNFRefutation 1.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 4 unt; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 35 ( 12 ~; 9 |; 3 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_0,conjecture,
( ! [X298,X299] :
( v_fun1(X298,X299)
=> ! [X300] :
( c_Natural_Oevaln(v_com,X299,hAPP(c_Nat_OSuc,v_n),X300)
=> v_fun2(X298,X300) ) )
=> ! [X298,X299] :
( v_fun1(X298,X299)
=> ! [X300] :
( c_Natural_Oevaln(v_com,X299,v_n,X300)
=> v_fun2(X298,X300) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.A4VHYcSTWb/E---3.1_18954.p',conj_0) ).
fof(fact_evaln__Suc,axiom,
! [X4,X5,X6,X7] :
( c_Natural_Oevaln(X7,X6,X5,X4)
=> c_Natural_Oevaln(X7,X6,hAPP(c_Nat_OSuc,X5),X4) ),
file('/export/starexec/sandbox/tmp/tmp.A4VHYcSTWb/E---3.1_18954.p',fact_evaln__Suc) ).
fof(c_0_2,negated_conjecture,
~ ( ! [X298,X299] :
( v_fun1(X298,X299)
=> ! [X300] :
( c_Natural_Oevaln(v_com,X299,hAPP(c_Nat_OSuc,v_n),X300)
=> v_fun2(X298,X300) ) )
=> ! [X298,X299] :
( v_fun1(X298,X299)
=> ! [X300] :
( c_Natural_Oevaln(v_com,X299,v_n,X300)
=> v_fun2(X298,X300) ) ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
fof(c_0_3,negated_conjecture,
! [X301,X302,X303] :
( ( ~ v_fun1(X301,X302)
| ~ c_Natural_Oevaln(v_com,X302,hAPP(c_Nat_OSuc,v_n),X303)
| v_fun2(X301,X303) )
& v_fun1(esk1_0,esk2_0)
& c_Natural_Oevaln(v_com,esk2_0,v_n,esk3_0)
& ~ v_fun2(esk1_0,esk3_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_2])])])])]) ).
fof(c_0_4,plain,
! [X307,X308,X309,X310] :
( ~ c_Natural_Oevaln(X310,X309,X308,X307)
| c_Natural_Oevaln(X310,X309,hAPP(c_Nat_OSuc,X308),X307) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_evaln__Suc])])]) ).
cnf(c_0_5,negated_conjecture,
( v_fun2(X1,X3)
| ~ v_fun1(X1,X2)
| ~ c_Natural_Oevaln(v_com,X2,hAPP(c_Nat_OSuc,v_n),X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( c_Natural_Oevaln(X1,X2,hAPP(c_Nat_OSuc,X3),X4)
| ~ c_Natural_Oevaln(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( v_fun2(X1,X2)
| ~ v_fun1(X1,X3)
| ~ c_Natural_Oevaln(v_com,X3,v_n,X2) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
c_Natural_Oevaln(v_com,esk2_0,v_n,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
~ v_fun2(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
( v_fun2(X1,esk3_0)
| ~ v_fun1(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
v_fun1(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW297+1 : TPTP v8.2.0. Released v5.2.0.
% 0.07/0.12 % Command : run_E %s %d THM
% 0.14/0.33 % Computer : n024.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Wed Jun 19 06:14:09 EDT 2024
% 0.14/0.33 % CPUTime :
% 1.07/1.21 Running first-order theorem proving
% 1.07/1.21 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.A4VHYcSTWb/E---3.1_18954.p
% 1.07/1.64 # Version: 3.2.0
% 1.07/1.64 # Preprocessing class: FMLMSMSMSSSNFFN.
% 1.07/1.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/1.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.07/1.64 # Starting new_bool_3 with 300s (1) cores
% 1.07/1.64 # Starting new_bool_1 with 300s (1) cores
% 1.07/1.64 # Starting sh5l with 300s (1) cores
% 1.07/1.64 # new_bool_3 with pid 19033 completed with status 0
% 1.07/1.64 # Result found by new_bool_3
% 1.07/1.64 # Preprocessing class: FMLMSMSMSSSNFFN.
% 1.07/1.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/1.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.07/1.64 # Starting new_bool_3 with 300s (1) cores
% 1.07/1.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.07/1.64 # Search class: FGHSM-FSLM32-DFFFFFNN
% 1.07/1.64 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1.07/1.64 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 1.07/1.64 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 19039 completed with status 0
% 1.07/1.64 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 1.07/1.64 # Preprocessing class: FMLMSMSMSSSNFFN.
% 1.07/1.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/1.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.07/1.64 # Starting new_bool_3 with 300s (1) cores
% 1.07/1.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.07/1.64 # Search class: FGHSM-FSLM32-DFFFFFNN
% 1.07/1.64 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1.07/1.64 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 1.07/1.64 # Preprocessing time : 0.016 s
% 1.07/1.64
% 1.07/1.64 # Proof found!
% 1.07/1.64 # SZS status Theorem
% 1.07/1.64 # SZS output start CNFRefutation
% See solution above
% 1.07/1.64 # Parsed axioms : 5225
% 1.07/1.64 # Removed by relevancy pruning/SinE : 4683
% 1.07/1.64 # Initial clauses : 835
% 1.07/1.64 # Removed in clause preprocessing : 43
% 1.07/1.64 # Initial clauses in saturation : 792
% 1.07/1.64 # Processed clauses : 805
% 1.07/1.64 # ...of these trivial : 25
% 1.07/1.64 # ...subsumed : 180
% 1.07/1.64 # ...remaining for further processing : 600
% 1.07/1.64 # Other redundant clauses eliminated : 95
% 1.07/1.64 # Clauses deleted for lack of memory : 0
% 1.07/1.64 # Backward-subsumed : 4
% 1.07/1.64 # Backward-rewritten : 10
% 1.07/1.64 # Generated clauses : 11265
% 1.07/1.64 # ...of the previous two non-redundant : 9927
% 1.07/1.64 # ...aggressively subsumed : 0
% 1.07/1.64 # Contextual simplify-reflections : 4
% 1.07/1.64 # Paramodulations : 11129
% 1.07/1.64 # Factorizations : 8
% 1.07/1.64 # NegExts : 0
% 1.07/1.64 # Equation resolutions : 129
% 1.07/1.64 # Disequality decompositions : 0
% 1.07/1.64 # Total rewrite steps : 4135
% 1.07/1.64 # ...of those cached : 3143
% 1.07/1.64 # Propositional unsat checks : 0
% 1.07/1.64 # Propositional check models : 0
% 1.07/1.64 # Propositional check unsatisfiable : 0
% 1.07/1.64 # Propositional clauses : 0
% 1.07/1.64 # Propositional clauses after purity: 0
% 1.07/1.64 # Propositional unsat core size : 0
% 1.07/1.64 # Propositional preprocessing time : 0.000
% 1.07/1.64 # Propositional encoding time : 0.000
% 1.07/1.64 # Propositional solver time : 0.000
% 1.07/1.64 # Success case prop preproc time : 0.000
% 1.07/1.64 # Success case prop encoding time : 0.000
% 1.07/1.64 # Success case prop solver time : 0.000
% 1.07/1.64 # Current number of processed clauses : 559
% 1.07/1.64 # Positive orientable unit clauses : 111
% 1.07/1.64 # Positive unorientable unit clauses: 12
% 1.07/1.64 # Negative unit clauses : 27
% 1.07/1.64 # Non-unit-clauses : 409
% 1.07/1.64 # Current number of unprocessed clauses: 9905
% 1.07/1.64 # ...number of literals in the above : 29666
% 1.07/1.64 # Current number of archived formulas : 0
% 1.07/1.64 # Current number of archived clauses : 14
% 1.07/1.64 # Clause-clause subsumption calls (NU) : 35671
% 1.07/1.64 # Rec. Clause-clause subsumption calls : 27676
% 1.07/1.64 # Non-unit clause-clause subsumptions : 154
% 1.07/1.64 # Unit Clause-clause subsumption calls : 287
% 1.07/1.64 # Rewrite failures with RHS unbound : 16
% 1.07/1.64 # BW rewrite match attempts : 1204
% 1.07/1.64 # BW rewrite match successes : 76
% 1.07/1.64 # Condensation attempts : 0
% 1.07/1.64 # Condensation successes : 0
% 1.07/1.64 # Termbank termtop insertions : 542016
% 1.07/1.64 # Search garbage collected termcells : 55092
% 1.07/1.64
% 1.07/1.64 # -------------------------------------------------
% 1.07/1.64 # User time : 0.269 s
% 1.07/1.64 # System time : 0.028 s
% 1.07/1.64 # Total time : 0.297 s
% 1.07/1.64 # Maximum resident set size: 11324 pages
% 1.07/1.64
% 1.07/1.64 # -------------------------------------------------
% 1.07/1.64 # User time : 0.382 s
% 1.07/1.64 # System time : 0.032 s
% 1.07/1.64 # Total time : 0.414 s
% 1.07/1.64 # Maximum resident set size: 9464 pages
% 1.07/1.64 % E---3.1 exiting
% 1.07/1.64 % E exiting
%------------------------------------------------------------------------------