TSTP Solution File: SWV077+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV077+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 5 unt; 0 def)
% Number of atoms : 51 ( 8 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 68 ( 27 ~; 20 |; 15 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_array_0018,conjecture,
( ( leq(n0,pv31)
& leq(pv31,minus(n5,n1)) )
=> ( leq(n0,pv31)
& leq(pv31,minus(n5,n1))
& ( n0 != pv40
=> ( leq(n0,pv31)
& leq(pv31,minus(n5,n1)) ) )
& ( n0 = pv40
=> true ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0018) ).
fof(ttrue,axiom,
true,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',ttrue) ).
fof(c_0_2,negated_conjecture,
~ ( ( leq(n0,pv31)
& leq(pv31,minus(n5,n1)) )
=> ( leq(n0,pv31)
& leq(pv31,minus(n5,n1))
& ( n0 != pv40
=> ( leq(n0,pv31)
& leq(pv31,minus(n5,n1)) ) )
& ( n0 = pv40
=> true ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cl5_nebula_array_0018])]) ).
fof(c_0_3,negated_conjecture,
( leq(n0,pv31)
& leq(pv31,minus(n5,n1))
& ( n0 = pv40
| n0 != pv40
| ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1)) )
& ( ~ true
| n0 != pv40
| ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1)) )
& ( n0 = pv40
| ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1)) )
& ( ~ true
| ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
cnf(c_0_4,negated_conjecture,
( ~ true
| ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
( ~ true
| ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1)) ),
inference(cn,[status(thm)],[c_0_4]) ).
cnf(c_0_6,plain,
true,
inference(split_conjunct,[status(thm)],[ttrue]) ).
cnf(c_0_7,negated_conjecture,
leq(n0,pv31),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
leq(pv31,minus(n5,n1)),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_7]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV077+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n015.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 08:15:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 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.21/0.49 # Version: 3.1.0
% 0.21/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 # Starting sh5l with 300s (1) cores
% 0.21/0.49 # new_bool_3 with pid 24424 completed with status 0
% 0.21/0.49 # Result found by new_bool_3
% 0.21/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.49 # Search class: FGHSM-FFMM21-MFFFFFNN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 181s (1) cores
% 0.21/0.49 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 24427 completed with status 0
% 0.21/0.49 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.21/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.49 # Search class: FGHSM-FFMM21-MFFFFFNN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 181s (1) cores
% 0.21/0.49 # Preprocessing time : 0.002 s
% 0.21/0.49 # Presaturation interreduction done
% 0.21/0.49
% 0.21/0.49 # Proof found!
% 0.21/0.49 # SZS status Theorem
% 0.21/0.49 # SZS output start CNFRefutation
% See solution above
% 0.21/0.49 # Parsed axioms : 85
% 0.21/0.49 # Removed by relevancy pruning/SinE : 23
% 0.21/0.49 # Initial clauses : 70
% 0.21/0.49 # Removed in clause preprocessing : 1
% 0.21/0.49 # Initial clauses in saturation : 69
% 0.21/0.49 # Processed clauses : 4
% 0.21/0.49 # ...of these trivial : 0
% 0.21/0.49 # ...subsumed : 0
% 0.21/0.49 # ...remaining for further processing : 3
% 0.21/0.49 # Other redundant clauses eliminated : 0
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 0
% 0.21/0.49 # Backward-rewritten : 0
% 0.21/0.49 # Generated clauses : 0
% 0.21/0.49 # ...of the previous two non-redundant : 0
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 0
% 0.21/0.49 # Paramodulations : 0
% 0.21/0.49 # Factorizations : 0
% 0.21/0.49 # NegExts : 0
% 0.21/0.49 # Equation resolutions : 0
% 0.21/0.49 # Disequality decompositions : 0
% 0.21/0.49 # Total rewrite steps : 3
% 0.21/0.49 # ...of those cached : 0
% 0.21/0.49 # Propositional unsat checks : 0
% 0.21/0.49 # Propositional check models : 0
% 0.21/0.49 # Propositional check unsatisfiable : 0
% 0.21/0.49 # Propositional clauses : 0
% 0.21/0.49 # Propositional clauses after purity: 0
% 0.21/0.49 # Propositional unsat core size : 0
% 0.21/0.49 # Propositional preprocessing time : 0.000
% 0.21/0.49 # Propositional encoding time : 0.000
% 0.21/0.49 # Propositional solver time : 0.000
% 0.21/0.49 # Success case prop preproc time : 0.000
% 0.21/0.49 # Success case prop encoding time : 0.000
% 0.21/0.49 # Success case prop solver time : 0.000
% 0.21/0.49 # Current number of processed clauses : 3
% 0.21/0.49 # Positive orientable unit clauses : 3
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 0
% 0.21/0.49 # Non-unit-clauses : 0
% 0.21/0.49 # Current number of unprocessed clauses: 65
% 0.21/0.49 # ...number of literals in the above : 115
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 0
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.49 # Non-unit clause-clause subsumptions : 0
% 0.21/0.49 # Unit Clause-clause subsumption calls : 0
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 0
% 0.21/0.49 # BW rewrite match successes : 0
% 0.21/0.49 # Condensation attempts : 0
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 3408
% 0.21/0.49 # Search garbage collected termcells : 613
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.006 s
% 0.21/0.49 # System time : 0.001 s
% 0.21/0.49 # Total time : 0.006 s
% 0.21/0.49 # Maximum resident set size: 1904 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.009 s
% 0.21/0.49 # System time : 0.002 s
% 0.21/0.49 # Total time : 0.012 s
% 0.21/0.49 # Maximum resident set size: 1812 pages
% 0.21/0.49 % E---3.1 exiting
% 0.21/0.49 % E exiting
%------------------------------------------------------------------------------