TSTP Solution File: SWV048+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWV048+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 05:33:03 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 20 unt; 0 def)
% Number of atoms : 62 ( 36 equ)
% Maximal formula atoms : 17 ( 2 avg)
% Number of connectives : 60 ( 22 ~; 14 |; 18 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 11 con; 0-3 aty)
% Number of variables : 9 ( 1 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_norm_0016,conjecture,
( ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) )
=> ( ( n0 != pv78
=> ( n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) ) )
& ( n0 = pv78
=> true ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_norm_0016) ).
fof(ttrue,axiom,
true,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',ttrue) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(pred_succ,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
fof(succ_tptp_minus_1,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_tptp_minus_1) ).
fof(sum_plus_base,axiom,
! [X23] : sum(n0,tptp_minus_1,X23) = n0,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',sum_plus_base) ).
fof(c_0_6,negated_conjecture,
~ ( ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) )
=> ( ( n0 != pv78
=> ( n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) ) )
& ( n0 = pv78
=> true ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cl5_nebula_norm_0016])]) ).
fof(c_0_7,negated_conjecture,
( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& leq(n0,pv35)
& leq(pv35,minus(n5,n1))
& ( n0 = pv78
| n0 != pv78 )
& ( ~ true
| n0 != pv78 )
& ( n0 = pv78
| n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
| 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(a_select3(q,pv81,pv35),a_select2(x,pv81)))
| 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_8,negated_conjecture,
( ~ true
| n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
| 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_7]) ).
cnf(c_0_9,negated_conjecture,
pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
true,
inference(split_conjunct,[status(thm)],[ttrue]) ).
cnf(c_0_11,negated_conjecture,
leq(n0,pv35),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
leq(pv35,minus(n5,n1)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_13,plain,
! [X45] : minus(X45,n1) = pred(X45),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
fof(c_0_14,plain,
! [X65] : pred(succ(X65)) = X65,
inference(variable_rename,[status(thm)],[pred_succ]) ).
cnf(c_0_15,negated_conjecture,
sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_16,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
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,pred(n0),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
pred(n0) = 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.11/0.12 % Problem : SWV048+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 09:03:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.50 # Version: 3.1.0
% 0.20/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # new_bool_3 with pid 690 completed with status 0
% 0.20/0.50 # Result found by new_bool_3
% 0.20/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.20/0.50 # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 693 completed with status 0
% 0.20/0.50 # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 0.20/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.20/0.50 # Preprocessing time : 0.002 s
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 92
% 0.20/0.50 # Removed by relevancy pruning/SinE : 22
% 0.20/0.50 # Initial clauses : 79
% 0.20/0.50 # Removed in clause preprocessing : 1
% 0.20/0.50 # Initial clauses in saturation : 78
% 0.20/0.50 # Processed clauses : 100
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 2
% 0.20/0.50 # ...remaining for further processing : 98
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 4
% 0.20/0.50 # Generated clauses : 232
% 0.20/0.50 # ...of the previous two non-redundant : 197
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 230
% 0.20/0.50 # Factorizations : 2
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 85
% 0.20/0.50 # ...of those cached : 62
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 94
% 0.20/0.50 # Positive orientable unit clauses : 64
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 10
% 0.20/0.50 # Non-unit-clauses : 20
% 0.20/0.50 # Current number of unprocessed clauses: 175
% 0.20/0.50 # ...number of literals in the above : 305
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 4
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 50
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 15
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 101
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 6
% 0.20/0.50 # BW rewrite match successes : 4
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 5810
% 0.20/0.50 # Search garbage collected termcells : 619
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.010 s
% 0.20/0.50 # System time : 0.002 s
% 0.20/0.50 # Total time : 0.012 s
% 0.20/0.50 # Maximum resident set size: 1916 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.013 s
% 0.20/0.50 # System time : 0.004 s
% 0.20/0.50 # Total time : 0.018 s
% 0.20/0.50 # Maximum resident set size: 1820 pages
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------