TSTP Solution File: SWV005-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV005-1 : TPTP v8.2.0. Released v1.0.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 : Tue May 21 05:20:39 EDT 2024
% Result : Unsatisfiable 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 11 unt; 4 nHn; 15 RR)
% Number of literals : 26 ( 0 equ; 13 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_8,negated_conjecture,
( less_than(X1,l)
| less_than(n,X1)
| ~ less_than(one,l)
| ~ less_than(a(X1),a(predecessor(l))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_5,negated_conjecture,
less_than(one,l),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_2,negated_conjecture,
~ less_than(k,l),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_1,negated_conjecture,
~ less_than(n,k),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_6,negated_conjecture,
less_than(a(k),a(predecessor(l))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(c_0_5,negated_conjecture,
( less_than(X1,l)
| less_than(n,X1)
| ~ less_than(one,l)
| ~ less_than(a(X1),a(predecessor(l))) ),
inference(fof_simplification,[status(thm)],[clause_8]) ).
cnf(c_0_6,negated_conjecture,
( less_than(X1,l)
| less_than(n,X1)
| ~ less_than(one,l)
| ~ less_than(a(X1),a(predecessor(l))) ),
c_0_5 ).
cnf(c_0_7,negated_conjecture,
less_than(one,l),
clause_5 ).
cnf(c_0_8,negated_conjecture,
~ less_than(k,l),
inference(fof_simplification,[status(thm)],[clause_2]) ).
cnf(c_0_9,negated_conjecture,
~ less_than(n,k),
inference(fof_simplification,[status(thm)],[clause_1]) ).
cnf(c_0_10,negated_conjecture,
( less_than(n,X1)
| less_than(X1,l)
| ~ less_than(a(X1),a(predecessor(l))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_11,negated_conjecture,
less_than(a(k),a(predecessor(l))),
clause_6 ).
cnf(c_0_12,negated_conjecture,
~ less_than(k,l),
c_0_8 ).
cnf(c_0_13,negated_conjecture,
~ less_than(n,k),
c_0_9 ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV005-1 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 09:28:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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/benchmark/theBenchmark.p
% 0.21/0.49 # Version: 3.1.0
% 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 19892 completed with status 0
% 0.21/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49 # No SInE strategy applied
% 0.21/0.49 # Search class: FGHSM-FFSS11-SFFFFFNN
% 0.21/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.49 # Starting sh5l with 136s (1) cores
% 0.21/0.49 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 19897 completed with status 0
% 0.21/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49 # No SInE strategy applied
% 0.21/0.49 # Search class: FGHSM-FFSS11-SFFFFFNN
% 0.21/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.49 # Preprocessing time : 0.001 s
% 0.21/0.49 # Presaturation interreduction done
% 0.21/0.49
% 0.21/0.49 # Proof found!
% 0.21/0.49 # SZS status Unsatisfiable
% 0.21/0.49 # SZS output start CNFRefutation
% See solution above
% 0.21/0.49 # Parsed axioms : 21
% 0.21/0.49 # Removed by relevancy pruning/SinE : 0
% 0.21/0.49 # Initial clauses : 21
% 0.21/0.49 # Removed in clause preprocessing : 2
% 0.21/0.49 # Initial clauses in saturation : 19
% 0.21/0.49 # Processed clauses : 50
% 0.21/0.49 # ...of these trivial : 1
% 0.21/0.49 # ...subsumed : 4
% 0.21/0.49 # ...remaining for further processing : 45
% 0.21/0.49 # Other redundant clauses eliminated : 4
% 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 : 50
% 0.21/0.49 # ...of the previous two non-redundant : 28
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 0
% 0.21/0.49 # Paramodulations : 42
% 0.21/0.49 # Factorizations : 2
% 0.21/0.49 # NegExts : 0
% 0.21/0.49 # Equation resolutions : 6
% 0.21/0.49 # Disequality decompositions : 0
% 0.21/0.49 # Total rewrite steps : 13
% 0.21/0.49 # ...of those cached : 6
% 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 : 26
% 0.21/0.49 # Positive orientable unit clauses : 7
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 9
% 0.21/0.49 # Non-unit-clauses : 10
% 0.21/0.49 # Current number of unprocessed clauses: 14
% 0.21/0.49 # ...number of literals in the above : 38
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 19
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 28
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 25
% 0.21/0.49 # Non-unit clause-clause subsumptions : 1
% 0.21/0.49 # Unit Clause-clause subsumption calls : 11
% 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 : 813
% 0.21/0.49 # Search garbage collected termcells : 49
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.003 s
% 0.21/0.49 # System time : 0.003 s
% 0.21/0.49 # Total time : 0.006 s
% 0.21/0.49 # Maximum resident set size: 1656 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.017 s
% 0.21/0.49 # System time : 0.007 s
% 0.21/0.49 # Total time : 0.024 s
% 0.21/0.49 # Maximum resident set size: 1716 pages
% 0.21/0.49 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------