TSTP Solution File: SWV174+1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SWV174+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 16:49:48 EDT 2024
% Result : Theorem 0.20s 0.55s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 7 unt; 0 def)
% Number of atoms : 71 ( 12 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 74 ( 18 ~; 15 |; 28 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-3 aty)
% Number of variables : 22 ( 0 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_init_0046,conjecture,
( ( leq(n0,pv10)
& leq(pv10,n135299)
& ! [X14] :
( ( leq(n0,X14)
& leq(X14,pred(pv10)) )
=> ! [X18] :
( ( leq(n0,X18)
& leq(X18,n4) )
=> a_select3(q_init,X14,X18) = init ) )
& ! [X4] :
( ( leq(n0,X4)
& leq(X4,n4) )
=> a_select3(center_init,X4,n0) = init ) )
=> ! [X20,X21] :
( ( leq(n0,X20)
& leq(n0,X21)
& leq(X20,n135299)
& leq(X21,n4) )
=> ( gt(pv10,X20)
=> a_select3(q_init,X20,X21) = init ) ) ),
file('/export/starexec/sandbox/tmp/tmp.mjSNWb572O/E---3.1_32691.p',cl5_nebula_init_0046) ).
fof(leq_gt_pred,axiom,
! [X1,X2] :
( leq(X1,pred(X2))
<=> gt(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.mjSNWb572O/E---3.1_32691.p',leq_gt_pred) ).
fof(c_0_2,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(pv10,n135299)
& ! [X14] :
( ( leq(n0,X14)
& leq(X14,pred(pv10)) )
=> ! [X18] :
( ( leq(n0,X18)
& leq(X18,n4) )
=> a_select3(q_init,X14,X18) = init ) )
& ! [X4] :
( ( leq(n0,X4)
& leq(X4,n4) )
=> a_select3(center_init,X4,n0) = init ) )
=> ! [X20,X21] :
( ( leq(n0,X20)
& leq(n0,X21)
& leq(X20,n135299)
& leq(X21,n4) )
=> ( gt(pv10,X20)
=> a_select3(q_init,X20,X21) = init ) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_init_0046]) ).
fof(c_0_3,negated_conjecture,
! [X28,X29,X30] :
( leq(n0,pv10)
& leq(pv10,n135299)
& ( ~ leq(n0,X28)
| ~ leq(X28,pred(pv10))
| ~ leq(n0,X29)
| ~ leq(X29,n4)
| a_select3(q_init,X28,X29) = init )
& ( ~ leq(n0,X30)
| ~ leq(X30,n4)
| a_select3(center_init,X30,n0) = init )
& leq(n0,esk1_0)
& leq(n0,esk2_0)
& leq(esk1_0,n135299)
& leq(esk2_0,n4)
& gt(pv10,esk1_0)
& a_select3(q_init,esk1_0,esk2_0) != init ),
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,
! [X60,X61] :
( ( ~ leq(X60,pred(X61))
| gt(X61,X60) )
& ( ~ gt(X61,X60)
| leq(X60,pred(X61)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt_pred])])]) ).
cnf(c_0_5,negated_conjecture,
( a_select3(q_init,X1,X2) = init
| ~ leq(n0,X1)
| ~ leq(X1,pred(pv10))
| ~ leq(n0,X2)
| ~ leq(X2,n4) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
leq(esk2_0,n4),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
leq(n0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,plain,
( leq(X2,pred(X1))
| ~ gt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
gt(pv10,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
( a_select3(q_init,X1,esk2_0) = init
| ~ leq(X1,pred(pv10))
| ~ leq(n0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).
cnf(c_0_11,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
leq(esk1_0,pred(pv10)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
a_select3(q_init,esk1_0,esk2_0) != init,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV174+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n028.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu Jun 20 18:06:24 EDT 2024
% 0.11/0.33 % 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/tmp/tmp.mjSNWb572O/E---3.1_32691.p
% 0.20/0.55 # Version: 3.2.0
% 0.20/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.55 # Starting sh5l with 300s (1) cores
% 0.20/0.55 # new_bool_3 with pid 302 completed with status 0
% 0.20/0.55 # Result found by new_bool_3
% 0.20/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.55 # Search class: FGUSM-FFMM31-MFFFFFNN
% 0.20/0.55 # partial match(1): FGHSM-FFMM31-MFFFFFNN
% 0.20/0.55 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.55 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.20/0.55 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 305 completed with status 0
% 0.20/0.55 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 0.20/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.55 # Search class: FGUSM-FFMM31-MFFFFFNN
% 0.20/0.55 # partial match(1): FGHSM-FFMM31-MFFFFFNN
% 0.20/0.55 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.55 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.20/0.55 # Preprocessing time : 0.002 s
% 0.20/0.55 # Presaturation interreduction done
% 0.20/0.55
% 0.20/0.55 # Proof found!
% 0.20/0.55 # SZS status Theorem
% 0.20/0.55 # SZS output start CNFRefutation
% See solution above
% 0.20/0.55 # Parsed axioms : 92
% 0.20/0.55 # Removed by relevancy pruning/SinE : 26
% 0.20/0.55 # Initial clauses : 78
% 0.20/0.55 # Removed in clause preprocessing : 0
% 0.20/0.55 # Initial clauses in saturation : 78
% 0.20/0.55 # Processed clauses : 891
% 0.20/0.55 # ...of these trivial : 131
% 0.20/0.55 # ...subsumed : 113
% 0.20/0.55 # ...remaining for further processing : 647
% 0.20/0.55 # Other redundant clauses eliminated : 0
% 0.20/0.55 # Clauses deleted for lack of memory : 0
% 0.20/0.55 # Backward-subsumed : 24
% 0.20/0.55 # Backward-rewritten : 0
% 0.20/0.55 # Generated clauses : 3874
% 0.20/0.55 # ...of the previous two non-redundant : 2277
% 0.20/0.55 # ...aggressively subsumed : 0
% 0.20/0.55 # Contextual simplify-reflections : 0
% 0.20/0.55 # Paramodulations : 3872
% 0.20/0.55 # Factorizations : 2
% 0.20/0.55 # NegExts : 0
% 0.20/0.55 # Equation resolutions : 0
% 0.20/0.55 # Disequality decompositions : 0
% 0.20/0.55 # Total rewrite steps : 2973
% 0.20/0.55 # ...of those cached : 2613
% 0.20/0.55 # Propositional unsat checks : 0
% 0.20/0.55 # Propositional check models : 0
% 0.20/0.55 # Propositional check unsatisfiable : 0
% 0.20/0.55 # Propositional clauses : 0
% 0.20/0.55 # Propositional clauses after purity: 0
% 0.20/0.55 # Propositional unsat core size : 0
% 0.20/0.55 # Propositional preprocessing time : 0.000
% 0.20/0.55 # Propositional encoding time : 0.000
% 0.20/0.55 # Propositional solver time : 0.000
% 0.20/0.55 # Success case prop preproc time : 0.000
% 0.20/0.55 # Success case prop encoding time : 0.000
% 0.20/0.55 # Success case prop solver time : 0.000
% 0.20/0.55 # Current number of processed clauses : 545
% 0.20/0.55 # Positive orientable unit clauses : 342
% 0.20/0.55 # Positive unorientable unit clauses: 0
% 0.20/0.55 # Negative unit clauses : 2
% 0.20/0.55 # Non-unit-clauses : 201
% 0.20/0.55 # Current number of unprocessed clauses: 1511
% 0.20/0.55 # ...number of literals in the above : 3426
% 0.20/0.55 # Current number of archived formulas : 0
% 0.20/0.55 # Current number of archived clauses : 102
% 0.20/0.55 # Clause-clause subsumption calls (NU) : 2155
% 0.20/0.55 # Rec. Clause-clause subsumption calls : 1489
% 0.20/0.55 # Non-unit clause-clause subsumptions : 113
% 0.20/0.55 # Unit Clause-clause subsumption calls : 1560
% 0.20/0.55 # Rewrite failures with RHS unbound : 0
% 0.20/0.55 # BW rewrite match attempts : 243
% 0.20/0.55 # BW rewrite match successes : 16
% 0.20/0.55 # Condensation attempts : 0
% 0.20/0.55 # Condensation successes : 0
% 0.20/0.55 # Termbank termtop insertions : 38930
% 0.20/0.55 # Search garbage collected termcells : 780
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.051 s
% 0.20/0.55 # System time : 0.006 s
% 0.20/0.55 # Total time : 0.057 s
% 0.20/0.55 # Maximum resident set size: 1920 pages
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.055 s
% 0.20/0.55 # System time : 0.007 s
% 0.20/0.55 # Total time : 0.062 s
% 0.20/0.55 # Maximum resident set size: 1796 pages
% 0.20/0.55 % E---3.1 exiting
% 0.20/0.55 % E exiting
%------------------------------------------------------------------------------