TSTP Solution File: SWV078+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV078+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:21:01 EDT 2024
% Result : Theorem 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 10 unt; 0 def)
% Number of atoms : 41 ( 14 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 43 ( 17 ~; 9 |; 11 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 3 ( 0 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_array_0019,conjecture,
( ( leq(n0,pv31)
& leq(pv31,minus(n5,n1)) )
=> ( ( n0 != pv70
=> ( leq(n0,pv31)
& leq(pv31,minus(n5,n1)) ) )
& ( n0 = pv70
=> true ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0019) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(ttrue,axiom,
true,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',ttrue) ).
fof(c_0_3,negated_conjecture,
~ ( ( leq(n0,pv31)
& leq(pv31,minus(n5,n1)) )
=> ( ( n0 != pv70
=> ( leq(n0,pv31)
& leq(pv31,minus(n5,n1)) ) )
& ( n0 = pv70
=> true ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cl5_nebula_array_0019])]) ).
fof(c_0_4,negated_conjecture,
( leq(n0,pv31)
& leq(pv31,minus(n5,n1))
& ( n0 = pv70
| n0 != pv70 )
& ( ~ true
| n0 != pv70 )
& ( n0 = pv70
| ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1)) )
& ( ~ true
| ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X50] : minus(X50,n1) = pred(X50),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
cnf(c_0_6,negated_conjecture,
( ~ true
| n0 != pv70 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
true,
inference(split_conjunct,[status(thm)],[ttrue]) ).
cnf(c_0_8,negated_conjecture,
( n0 = pv70
| ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
leq(n0,pv31),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
pv70 != n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_12,negated_conjecture,
leq(pv31,minus(n5,n1)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
~ leq(pv31,pred(n5)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),c_0_11]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_10]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWV078+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n016.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun May 19 09:28:53 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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/benchmark/theBenchmark.p
% 0.15/0.42 # Version: 3.1.0
% 0.15/0.42 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # sh5l with pid 841 completed with status 0
% 0.15/0.42 # Result found by sh5l
% 0.15/0.42 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.42 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.15/0.42 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.15/0.42 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 844 completed with status 0
% 0.15/0.42 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 0.15/0.42 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.42 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.15/0.42 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.15/0.42 # Preprocessing time : 0.001 s
% 0.15/0.42 # Presaturation interreduction done
% 0.15/0.42
% 0.15/0.42 # Proof found!
% 0.15/0.42 # SZS status Theorem
% 0.15/0.42 # SZS output start CNFRefutation
% See solution above
% 0.15/0.42 # Parsed axioms : 85
% 0.15/0.42 # Removed by relevancy pruning/SinE : 21
% 0.15/0.42 # Initial clauses : 72
% 0.15/0.42 # Removed in clause preprocessing : 1
% 0.15/0.42 # Initial clauses in saturation : 71
% 0.15/0.42 # Processed clauses : 72
% 0.15/0.42 # ...of these trivial : 0
% 0.15/0.42 # ...subsumed : 1
% 0.15/0.42 # ...remaining for further processing : 70
% 0.15/0.42 # Other redundant clauses eliminated : 0
% 0.15/0.42 # Clauses deleted for lack of memory : 0
% 0.15/0.42 # Backward-subsumed : 0
% 0.15/0.42 # Backward-rewritten : 1
% 0.15/0.42 # Generated clauses : 0
% 0.15/0.42 # ...of the previous two non-redundant : 1
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 0
% 0.15/0.42 # Paramodulations : 0
% 0.15/0.42 # Factorizations : 0
% 0.15/0.42 # NegExts : 0
% 0.15/0.42 # Equation resolutions : 0
% 0.15/0.42 # Disequality decompositions : 0
% 0.15/0.42 # Total rewrite steps : 18
% 0.15/0.42 # ...of those cached : 10
% 0.15/0.42 # Propositional unsat checks : 0
% 0.15/0.42 # Propositional check models : 0
% 0.15/0.42 # Propositional check unsatisfiable : 0
% 0.15/0.42 # Propositional clauses : 0
% 0.15/0.42 # Propositional clauses after purity: 0
% 0.15/0.42 # Propositional unsat core size : 0
% 0.15/0.42 # Propositional preprocessing time : 0.000
% 0.15/0.42 # Propositional encoding time : 0.000
% 0.15/0.42 # Propositional solver time : 0.000
% 0.15/0.42 # Success case prop preproc time : 0.000
% 0.15/0.42 # Success case prop encoding time : 0.000
% 0.15/0.42 # Success case prop solver time : 0.000
% 0.15/0.42 # Current number of processed clauses : 69
% 0.15/0.42 # Positive orientable unit clauses : 46
% 0.15/0.42 # Positive unorientable unit clauses: 0
% 0.15/0.42 # Negative unit clauses : 3
% 0.15/0.42 # Non-unit-clauses : 20
% 0.15/0.42 # Current number of unprocessed clauses: 0
% 0.15/0.42 # ...number of literals in the above : 0
% 0.15/0.42 # Current number of archived formulas : 0
% 0.15/0.42 # Current number of archived clauses : 1
% 0.15/0.42 # Clause-clause subsumption calls (NU) : 42
% 0.15/0.42 # Rec. Clause-clause subsumption calls : 7
% 0.15/0.42 # Non-unit clause-clause subsumptions : 0
% 0.15/0.42 # Unit Clause-clause subsumption calls : 4
% 0.15/0.42 # Rewrite failures with RHS unbound : 0
% 0.15/0.42 # BW rewrite match attempts : 2
% 0.15/0.42 # BW rewrite match successes : 1
% 0.15/0.42 # Condensation attempts : 0
% 0.15/0.42 # Condensation successes : 0
% 0.15/0.42 # Termbank termtop insertions : 3662
% 0.15/0.42 # Search garbage collected termcells : 599
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.005 s
% 0.15/0.42 # System time : 0.001 s
% 0.15/0.42 # Total time : 0.006 s
% 0.15/0.42 # Maximum resident set size: 1900 pages
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.008 s
% 0.15/0.42 # System time : 0.002 s
% 0.15/0.42 # Total time : 0.011 s
% 0.15/0.42 # Maximum resident set size: 1812 pages
% 0.15/0.42 % E---3.1 exiting
% 0.15/0.42 % E exiting
%------------------------------------------------------------------------------