TSTP Solution File: SWV056+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV056+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:43 EDT 2024
% Result : Theorem 0.23s 0.53s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 17 unt; 0 def)
% Number of atoms : 35 ( 18 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 23 ( 9 ~; 4 |; 8 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 9 ( 1 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_norm_0040,conjecture,
( ( leq(n0,pv25)
& leq(pv25,minus(n5,n1)) )
=> ( n0 = sum(n0,minus(n0,n1),a_select3(q,pv77,pv25))
& leq(n0,pv25)
& leq(pv25,minus(n5,n1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8TOT5HbyyW/E---3.1_2684.p',cl5_nebula_norm_0040) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox2/tmp/tmp.8TOT5HbyyW/E---3.1_2684.p',pred_minus_1) ).
fof(pred_succ,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.8TOT5HbyyW/E---3.1_2684.p',pred_succ) ).
fof(succ_tptp_minus_1,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox2/tmp/tmp.8TOT5HbyyW/E---3.1_2684.p',succ_tptp_minus_1) ).
fof(sum_plus_base,axiom,
! [X23] : sum(n0,tptp_minus_1,X23) = n0,
file('/export/starexec/sandbox2/tmp/tmp.8TOT5HbyyW/E---3.1_2684.p',sum_plus_base) ).
fof(c_0_5,negated_conjecture,
~ ( ( leq(n0,pv25)
& leq(pv25,minus(n5,n1)) )
=> ( n0 = sum(n0,minus(n0,n1),a_select3(q,pv77,pv25))
& leq(n0,pv25)
& leq(pv25,minus(n5,n1)) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_norm_0040]) ).
fof(c_0_6,negated_conjecture,
( leq(n0,pv25)
& leq(pv25,minus(n5,n1))
& ( n0 != sum(n0,minus(n0,n1),a_select3(q,pv77,pv25))
| ~ leq(n0,pv25)
| ~ leq(pv25,minus(n5,n1)) ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
cnf(c_0_7,negated_conjecture,
( n0 != sum(n0,minus(n0,n1),a_select3(q,pv77,pv25))
| ~ leq(n0,pv25)
| ~ leq(pv25,minus(n5,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_8,negated_conjecture,
leq(n0,pv25),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
leq(pv25,minus(n5,n1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X45] : minus(X45,n1) = pred(X45),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
fof(c_0_11,plain,
! [X65] : pred(succ(X65)) = X65,
inference(variable_rename,[status(thm)],[pred_succ]) ).
cnf(c_0_12,negated_conjecture,
sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) != n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_13,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[succ_tptp_minus_1]) ).
fof(c_0_16,plain,
! [X55] : sum(n0,tptp_minus_1,X55) = n0,
inference(variable_rename,[status(thm)],[sum_plus_base]) ).
cnf(c_0_17,negated_conjecture,
sum(n0,pred(n0),a_select3(q,pv77,pv25)) != n0,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
pred(n0) = tptp_minus_1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
sum(n0,tptp_minus_1,X1) = n0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SWV056+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n026.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 16:33:23 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.51 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.8TOT5HbyyW/E---3.1_2684.p
% 0.23/0.53 # Version: 3.1.0
% 0.23/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # Starting sh5l with 300s (1) cores
% 0.23/0.53 # new_bool_3 with pid 2763 completed with status 0
% 0.23/0.53 # Result found by new_bool_3
% 0.23/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.53 # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.23/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.23/0.53 # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 2766 completed with status 0
% 0.23/0.53 # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 0.23/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.53 # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.23/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.23/0.53 # Preprocessing time : 0.002 s
% 0.23/0.53
% 0.23/0.53 # Proof found!
% 0.23/0.53 # SZS status Theorem
% 0.23/0.53 # SZS output start CNFRefutation
% See solution above
% 0.23/0.53 # Parsed axioms : 85
% 0.23/0.53 # Removed by relevancy pruning/SinE : 23
% 0.23/0.53 # Initial clauses : 67
% 0.23/0.53 # Removed in clause preprocessing : 0
% 0.23/0.53 # Initial clauses in saturation : 67
% 0.23/0.53 # Processed clauses : 82
% 0.23/0.53 # ...of these trivial : 0
% 0.23/0.53 # ...subsumed : 0
% 0.23/0.53 # ...remaining for further processing : 82
% 0.23/0.53 # Other redundant clauses eliminated : 0
% 0.23/0.53 # Clauses deleted for lack of memory : 0
% 0.23/0.53 # Backward-subsumed : 0
% 0.23/0.53 # Backward-rewritten : 3
% 0.23/0.53 # Generated clauses : 205
% 0.23/0.53 # ...of the previous two non-redundant : 166
% 0.23/0.53 # ...aggressively subsumed : 0
% 0.23/0.53 # Contextual simplify-reflections : 0
% 0.23/0.53 # Paramodulations : 203
% 0.23/0.53 # Factorizations : 2
% 0.23/0.53 # NegExts : 0
% 0.23/0.53 # Equation resolutions : 0
% 0.23/0.53 # Disequality decompositions : 0
% 0.23/0.53 # Total rewrite steps : 85
% 0.23/0.53 # ...of those cached : 65
% 0.23/0.53 # Propositional unsat checks : 0
% 0.23/0.53 # Propositional check models : 0
% 0.23/0.53 # Propositional check unsatisfiable : 0
% 0.23/0.53 # Propositional clauses : 0
% 0.23/0.53 # Propositional clauses after purity: 0
% 0.23/0.53 # Propositional unsat core size : 0
% 0.23/0.53 # Propositional preprocessing time : 0.000
% 0.23/0.53 # Propositional encoding time : 0.000
% 0.23/0.53 # Propositional solver time : 0.000
% 0.23/0.53 # Success case prop preproc time : 0.000
% 0.23/0.53 # Success case prop encoding time : 0.000
% 0.23/0.53 # Success case prop solver time : 0.000
% 0.23/0.53 # Current number of processed clauses : 79
% 0.23/0.53 # Positive orientable unit clauses : 50
% 0.23/0.53 # Positive unorientable unit clauses: 0
% 0.23/0.53 # Negative unit clauses : 9
% 0.23/0.53 # Non-unit-clauses : 20
% 0.23/0.53 # Current number of unprocessed clauses: 151
% 0.23/0.53 # ...number of literals in the above : 270
% 0.23/0.53 # Current number of archived formulas : 0
% 0.23/0.53 # Current number of archived clauses : 3
% 0.23/0.53 # Clause-clause subsumption calls (NU) : 33
% 0.23/0.53 # Rec. Clause-clause subsumption calls : 8
% 0.23/0.53 # Non-unit clause-clause subsumptions : 0
% 0.23/0.53 # Unit Clause-clause subsumption calls : 108
% 0.23/0.53 # Rewrite failures with RHS unbound : 0
% 0.23/0.53 # BW rewrite match attempts : 5
% 0.23/0.53 # BW rewrite match successes : 3
% 0.23/0.53 # Condensation attempts : 0
% 0.23/0.53 # Condensation successes : 0
% 0.23/0.53 # Termbank termtop insertions : 5200
% 0.23/0.53 # Search garbage collected termcells : 582
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.010 s
% 0.23/0.53 # System time : 0.000 s
% 0.23/0.53 # Total time : 0.010 s
% 0.23/0.53 # Maximum resident set size: 1908 pages
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.013 s
% 0.23/0.53 # System time : 0.003 s
% 0.23/0.53 # Total time : 0.015 s
% 0.23/0.53 # Maximum resident set size: 1796 pages
% 0.23/0.53 % E---3.1 exiting
% 0.23/0.53 % E exiting
%------------------------------------------------------------------------------