TSTP Solution File: SWV009-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV009-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:40 EDT 2024
% Result : Unsatisfiable 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 13 unt; 2 nHn; 23 RR)
% Number of literals : 58 ( 0 equ; 38 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_9,negated_conjecture,
~ less_or_equal(a(p),a(q)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_6,negated_conjecture,
( less_or_equal(a(X1),a(X2))
| ~ less_or_equal(m,X1)
| ~ less(X1,i)
| ~ less(j,X2)
| ~ less_or_equal(X2,n) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_7,negated_conjecture,
( less_or_equal(a(X1),a(X2))
| ~ less_or_equal(m,X1)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,j) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_5,negated_conjecture,
less_or_equal(q,n),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_3,negated_conjecture,
less_or_equal(m,p),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_4,negated_conjecture,
less_or_equal(p,q),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_8,negated_conjecture,
( less_or_equal(a(X1),a(X2))
| ~ less_or_equal(i,X1)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,n) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_1,negated_conjecture,
( less_or_equal(X1,X2)
| less(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(c_0_8,negated_conjecture,
~ less_or_equal(a(p),a(q)),
inference(fof_simplification,[status(thm)],[clause_9]) ).
cnf(c_0_9,negated_conjecture,
( less_or_equal(a(X1),a(X2))
| ~ less_or_equal(m,X1)
| ~ less(X1,i)
| ~ less(j,X2)
| ~ less_or_equal(X2,n) ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_10,negated_conjecture,
( less_or_equal(a(X1),a(X2))
| ~ less_or_equal(m,X1)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,j) ),
inference(fof_simplification,[status(thm)],[clause_7]) ).
cnf(c_0_11,negated_conjecture,
~ less_or_equal(a(p),a(q)),
c_0_8 ).
cnf(c_0_12,negated_conjecture,
( less_or_equal(a(X1),a(X2))
| ~ less_or_equal(m,X1)
| ~ less(X1,i)
| ~ less(j,X2)
| ~ less_or_equal(X2,n) ),
c_0_9 ).
cnf(c_0_13,negated_conjecture,
less_or_equal(q,n),
clause_5 ).
cnf(c_0_14,negated_conjecture,
less_or_equal(m,p),
clause_3 ).
cnf(c_0_15,negated_conjecture,
( less_or_equal(a(X1),a(X2))
| ~ less_or_equal(m,X1)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,j) ),
c_0_10 ).
cnf(c_0_16,negated_conjecture,
less_or_equal(p,q),
clause_4 ).
cnf(c_0_17,negated_conjecture,
( less_or_equal(a(X1),a(X2))
| ~ less_or_equal(i,X1)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,n) ),
inference(fof_simplification,[status(thm)],[clause_8]) ).
cnf(c_0_18,negated_conjecture,
( ~ less(p,i)
| ~ less(j,q) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_19,negated_conjecture,
( less_or_equal(X1,X2)
| less(X2,X1) ),
clause_1 ).
cnf(c_0_20,negated_conjecture,
~ less_or_equal(q,j),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_15]),c_0_14]),c_0_16])]) ).
cnf(c_0_21,negated_conjecture,
( less_or_equal(a(X1),a(X2))
| ~ less_or_equal(i,X1)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,n) ),
c_0_17 ).
cnf(c_0_22,negated_conjecture,
~ less(p,i),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_23,negated_conjecture,
~ less_or_equal(i,p),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_21]),c_0_13]),c_0_16])]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_19]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWV009-1 : TPTP v8.2.0. Released v1.0.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n028.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 08:57:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.51 # Version: 3.1.0
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # new_bool_3 with pid 8645 completed with status 0
% 0.21/0.51 # Result found by new_bool_3
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51 # Search class: FGUNF-FFSS11-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.51 # SAT001_MinMin_p005000_rr_RG with pid 8649 completed with status 0
% 0.21/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51 # Search class: FGUNF-FFSS11-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Unsatisfiable
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 9
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 9
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 9
% 0.21/0.51 # Processed clauses : 22
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 0
% 0.21/0.51 # ...remaining for further processing : 22
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 1
% 0.21/0.51 # Backward-rewritten : 0
% 0.21/0.51 # Generated clauses : 5
% 0.21/0.51 # ...of the previous two non-redundant : 4
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 5
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 6
% 0.21/0.51 # ...of those cached : 3
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 12
% 0.21/0.51 # Positive orientable unit clauses : 4
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 4
% 0.21/0.51 # Non-unit-clauses : 4
% 0.21/0.51 # Current number of unprocessed clauses: 0
% 0.21/0.51 # ...number of literals in the above : 0
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 10
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 5
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 4
% 0.21/0.51 # Non-unit clause-clause subsumptions : 0
% 0.21/0.51 # Unit Clause-clause subsumption calls : 6
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 0
% 0.21/0.51 # BW rewrite match successes : 0
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 365
% 0.21/0.51 # Search garbage collected termcells : 24
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.004 s
% 0.21/0.51 # System time : 0.001 s
% 0.21/0.51 # Total time : 0.005 s
% 0.21/0.51 # Maximum resident set size: 1604 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.004 s
% 0.21/0.51 # System time : 0.004 s
% 0.21/0.51 # Total time : 0.008 s
% 0.21/0.51 # Maximum resident set size: 1692 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------