TSTP Solution File: SWV046+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV046+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 : Sat May 4 09:42:41 EDT 2024
% Result : Theorem 0.21s 0.56s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 20 unt; 0 def)
% Number of atoms : 65 ( 39 equ)
% Maximal formula atoms : 18 ( 2 avg)
% Number of connectives : 62 ( 21 ~; 14 |; 21 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 24 ( 24 usr; 15 con; 0-3 aty)
% Number of variables : 10 ( 1 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_norm_0010,conjecture,
( ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) )
=> ( ( n0 != pv44
=> ( n0 = sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) ) )
& ( n0 = pv44
=> true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.67PKPcuTP1/E---3.1_32745.p',cl5_nebula_norm_0010) ).
fof(pred_succ,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.67PKPcuTP1/E---3.1_32745.p',pred_succ) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox/tmp/tmp.67PKPcuTP1/E---3.1_32745.p',pred_minus_1) ).
fof(ttrue,axiom,
true,
file('/export/starexec/sandbox/tmp/tmp.67PKPcuTP1/E---3.1_32745.p',ttrue) ).
fof(succ_tptp_minus_1,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox/tmp/tmp.67PKPcuTP1/E---3.1_32745.p',succ_tptp_minus_1) ).
fof(sum_plus_base,axiom,
! [X23] : sum(n0,tptp_minus_1,X23) = n0,
file('/export/starexec/sandbox/tmp/tmp.67PKPcuTP1/E---3.1_32745.p',sum_plus_base) ).
fof(c_0_6,negated_conjecture,
~ ( ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) )
=> ( ( n0 != pv44
=> ( n0 = sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) ) )
& ( n0 = pv44
=> true ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cl5_nebula_norm_0010])]) ).
fof(c_0_7,plain,
! [X78] : pred(succ(X78)) = X78,
inference(variable_rename,[status(thm)],[pred_succ]) ).
fof(c_0_8,plain,
! [X45] : minus(X45,n1) = pred(X45),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
fof(c_0_9,negated_conjecture,
( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1))
& ( n0 = pv44
| n0 != pv44 )
& ( ~ true
| n0 != pv44 )
& ( n0 = pv44
| n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1)) )
& ( ~ true
| n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_10,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( ~ true
| n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
true,
inference(split_conjunct,[status(thm)],[ttrue]) ).
cnf(c_0_15,negated_conjecture,
leq(n0,pv35),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
leq(pv35,minus(n5,n1)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
minus(succ(X1),n1) = X1,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[succ_tptp_minus_1]) ).
fof(c_0_19,plain,
! [X55] : sum(n0,tptp_minus_1,X55) = n0,
inference(variable_rename,[status(thm)],[sum_plus_base]) ).
cnf(c_0_20,negated_conjecture,
sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) != n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_21,plain,
minus(n0,n1) = tptp_minus_1,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
sum(n0,tptp_minus_1,X1) = n0,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWV046+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n020.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 16:29:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.67PKPcuTP1/E---3.1_32745.p
% 0.21/0.56 # Version: 3.1.0
% 0.21/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.56 # Starting sh5l with 300s (1) cores
% 0.21/0.56 # new_bool_3 with pid 356 completed with status 0
% 0.21/0.56 # Result found by new_bool_3
% 0.21/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.56 # Search class: FGHSM-FFMM32-DFFFFFNN
% 0.21/0.56 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.56 # Starting new_ho_10 with 55s (1) cores
% 0.21/0.56 # new_ho_10 with pid 359 completed with status 0
% 0.21/0.56 # Result found by new_ho_10
% 0.21/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.56 # Search class: FGHSM-FFMM32-DFFFFFNN
% 0.21/0.56 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.56 # Starting new_ho_10 with 55s (1) cores
% 0.21/0.56 # Preprocessing time : 0.003 s
% 0.21/0.56 # Presaturation interreduction done
% 0.21/0.56
% 0.21/0.56 # Proof found!
% 0.21/0.56 # SZS status Theorem
% 0.21/0.56 # SZS output start CNFRefutation
% See solution above
% 0.21/0.56 # Parsed axioms : 92
% 0.21/0.56 # Removed by relevancy pruning/SinE : 19
% 0.21/0.56 # Initial clauses : 85
% 0.21/0.56 # Removed in clause preprocessing : 1
% 0.21/0.56 # Initial clauses in saturation : 84
% 0.21/0.56 # Processed clauses : 146
% 0.21/0.56 # ...of these trivial : 0
% 0.21/0.56 # ...subsumed : 1
% 0.21/0.56 # ...remaining for further processing : 145
% 0.21/0.56 # Other redundant clauses eliminated : 1
% 0.21/0.56 # Clauses deleted for lack of memory : 0
% 0.21/0.56 # Backward-subsumed : 0
% 0.21/0.56 # Backward-rewritten : 3
% 0.21/0.56 # Generated clauses : 38
% 0.21/0.56 # ...of the previous two non-redundant : 37
% 0.21/0.56 # ...aggressively subsumed : 0
% 0.21/0.56 # Contextual simplify-reflections : 0
% 0.21/0.56 # Paramodulations : 37
% 0.21/0.56 # Factorizations : 0
% 0.21/0.56 # NegExts : 0
% 0.21/0.56 # Equation resolutions : 1
% 0.21/0.56 # Disequality decompositions : 0
% 0.21/0.56 # Total rewrite steps : 31
% 0.21/0.56 # ...of those cached : 14
% 0.21/0.56 # Propositional unsat checks : 0
% 0.21/0.56 # Propositional check models : 0
% 0.21/0.56 # Propositional check unsatisfiable : 0
% 0.21/0.56 # Propositional clauses : 0
% 0.21/0.56 # Propositional clauses after purity: 0
% 0.21/0.56 # Propositional unsat core size : 0
% 0.21/0.56 # Propositional preprocessing time : 0.000
% 0.21/0.56 # Propositional encoding time : 0.000
% 0.21/0.56 # Propositional solver time : 0.000
% 0.21/0.56 # Success case prop preproc time : 0.000
% 0.21/0.56 # Success case prop encoding time : 0.000
% 0.21/0.56 # Success case prop solver time : 0.000
% 0.21/0.56 # Current number of processed clauses : 58
% 0.21/0.56 # Positive orientable unit clauses : 53
% 0.21/0.56 # Positive unorientable unit clauses: 0
% 0.21/0.56 # Negative unit clauses : 2
% 0.21/0.56 # Non-unit-clauses : 3
% 0.21/0.56 # Current number of unprocessed clauses: 58
% 0.21/0.56 # ...number of literals in the above : 110
% 0.21/0.56 # Current number of archived formulas : 0
% 0.21/0.56 # Current number of archived clauses : 86
% 0.21/0.56 # Clause-clause subsumption calls (NU) : 65
% 0.21/0.56 # Rec. Clause-clause subsumption calls : 27
% 0.21/0.56 # Non-unit clause-clause subsumptions : 0
% 0.21/0.56 # Unit Clause-clause subsumption calls : 8
% 0.21/0.56 # Rewrite failures with RHS unbound : 0
% 0.21/0.56 # BW rewrite match attempts : 12
% 0.21/0.56 # BW rewrite match successes : 5
% 0.21/0.56 # Condensation attempts : 146
% 0.21/0.56 # Condensation successes : 0
% 0.21/0.56 # Termbank termtop insertions : 4939
% 0.21/0.56 # Search garbage collected termcells : 709
% 0.21/0.56
% 0.21/0.56 # -------------------------------------------------
% 0.21/0.56 # User time : 0.011 s
% 0.21/0.56 # System time : 0.003 s
% 0.21/0.56 # Total time : 0.014 s
% 0.21/0.56 # Maximum resident set size: 2076 pages
% 0.21/0.56
% 0.21/0.56 # -------------------------------------------------
% 0.21/0.56 # User time : 0.014 s
% 0.21/0.56 # System time : 0.005 s
% 0.21/0.56 # Total time : 0.019 s
% 0.21/0.56 # Maximum resident set size: 1812 pages
% 0.21/0.56 % E---3.1 exiting
% 0.21/0.56 % E exiting
%------------------------------------------------------------------------------