TSTP Solution File: SWV019-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV019-1 : TPTP v8.2.0. Released v2.4.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:44 EDT 2024
% Result : Timeout 300.21s 100.49s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 37 ( 15 unt; 7 nHn; 33 RR)
% Number of literals : 87 ( 6 equ; 48 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
( less_than(successor(an_index),lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| less_than(index_of_maximal,lower_bound)
| ~ in_array_bounds(array,an_index)
| ~ less_than(index_of_maximal,successor(an_index))
| ~ in_array_bounds(array,index_of_maximal)
| maximal_value != array_value_at(array,index_of_maximal) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(maximal_above_lower_bound,axiom,
~ less_than(index_of_maximal,lower_bound),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',maximal_above_lower_bound) ).
cnf(this_is_maximal,axiom,
( maximal_value = array_value_at(array,index_of_maximal)
| ~ in_array_bounds(array,index_of_maximal) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',this_is_maximal) ).
cnf(predecessor_less,axiom,
( less_than(X1,X2)
| ~ less_than(successor(X1),successor(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',predecessor_less) ).
cnf(somewhere_below_upper_bound,axiom,
~ less_than(upper_bound,an_index),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',somewhere_below_upper_bound) ).
cnf(somewhere_above_lower_bound,axiom,
~ less_than(an_index,lower_bound),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',somewhere_above_lower_bound) ).
cnf(transitivity_of_less,axiom,
( less_than(X1,X3)
| ~ less_than(X1,X2)
| ~ less_than(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_less) ).
cnf(in_bounds,axiom,
( less_than(X1,lower_bound)
| less_than(upper_bound,X1)
| in_array_bounds(array,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',in_bounds) ).
cnf(maximal_before_somewhere,axiom,
less_than(index_of_maximal,an_index),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',maximal_before_somewhere) ).
cnf(successor_greater,axiom,
less_than(X1,successor(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_greater) ).
cnf(c_0_10,negated_conjecture,
( less_than(successor(an_index),lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| less_than(index_of_maximal,lower_bound)
| ~ in_array_bounds(array,an_index)
| ~ less_than(index_of_maximal,successor(an_index))
| ~ in_array_bounds(array,index_of_maximal)
| maximal_value != array_value_at(array,index_of_maximal) ),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_11,plain,
~ less_than(index_of_maximal,lower_bound),
inference(fof_simplification,[status(thm)],[maximal_above_lower_bound]) ).
cnf(c_0_12,plain,
( maximal_value = array_value_at(array,index_of_maximal)
| ~ in_array_bounds(array,index_of_maximal) ),
inference(fof_simplification,[status(thm)],[this_is_maximal]) ).
cnf(c_0_13,plain,
( less_than(X1,X2)
| ~ less_than(successor(X1),successor(X2)) ),
inference(fof_simplification,[status(thm)],[predecessor_less]) ).
cnf(c_0_14,negated_conjecture,
( less_than(successor(an_index),lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| less_than(index_of_maximal,lower_bound)
| ~ in_array_bounds(array,an_index)
| ~ less_than(index_of_maximal,successor(an_index))
| ~ in_array_bounds(array,index_of_maximal)
| maximal_value != array_value_at(array,index_of_maximal) ),
c_0_10 ).
cnf(c_0_15,plain,
~ less_than(index_of_maximal,lower_bound),
c_0_11 ).
cnf(c_0_16,plain,
( maximal_value = array_value_at(array,index_of_maximal)
| ~ in_array_bounds(array,index_of_maximal) ),
c_0_12 ).
cnf(c_0_17,plain,
~ less_than(upper_bound,an_index),
inference(fof_simplification,[status(thm)],[somewhere_below_upper_bound]) ).
cnf(c_0_18,plain,
( less_than(X1,X2)
| ~ less_than(successor(X1),successor(X2)) ),
c_0_13 ).
cnf(c_0_19,negated_conjecture,
( less_than(successor(upper_bound),successor(an_index))
| less_than(successor(an_index),lower_bound)
| ~ in_array_bounds(array,index_of_maximal)
| ~ in_array_bounds(array,an_index)
| ~ less_than(index_of_maximal,successor(an_index)) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_20,plain,
~ less_than(upper_bound,an_index),
c_0_17 ).
cnf(c_0_21,plain,
~ less_than(an_index,lower_bound),
inference(fof_simplification,[status(thm)],[somewhere_above_lower_bound]) ).
cnf(c_0_22,plain,
( less_than(X1,X3)
| ~ less_than(X1,X2)
| ~ less_than(X2,X3) ),
inference(fof_simplification,[status(thm)],[transitivity_of_less]) ).
cnf(c_0_23,negated_conjecture,
( less_than(successor(an_index),lower_bound)
| ~ in_array_bounds(array,index_of_maximal)
| ~ in_array_bounds(array,an_index)
| ~ less_than(index_of_maximal,successor(an_index)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_24,axiom,
( less_than(X1,lower_bound)
| less_than(upper_bound,X1)
| in_array_bounds(array,X1) ),
in_bounds ).
cnf(c_0_25,plain,
~ less_than(an_index,lower_bound),
c_0_21 ).
cnf(c_0_26,plain,
( less_than(X1,X3)
| ~ less_than(X1,X2)
| ~ less_than(X2,X3) ),
c_0_22 ).
cnf(c_0_27,axiom,
less_than(index_of_maximal,an_index),
maximal_before_somewhere ).
cnf(c_0_28,negated_conjecture,
( less_than(successor(an_index),lower_bound)
| ~ in_array_bounds(array,index_of_maximal)
| ~ less_than(index_of_maximal,successor(an_index)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_20]) ).
cnf(c_0_29,plain,
( less_than(X1,an_index)
| ~ less_than(X1,index_of_maximal) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( less_than(successor(an_index),lower_bound)
| less_than(upper_bound,index_of_maximal)
| ~ less_than(index_of_maximal,successor(an_index)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_24]),c_0_15]) ).
cnf(c_0_31,plain,
~ less_than(upper_bound,index_of_maximal),
inference(spm,[status(thm)],[c_0_20,c_0_29]) ).
cnf(c_0_32,axiom,
less_than(X1,successor(X1)),
successor_greater ).
cnf(c_0_33,negated_conjecture,
( less_than(X1,lower_bound)
| ~ less_than(index_of_maximal,successor(an_index))
| ~ less_than(X1,successor(an_index)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_30]),c_0_31]) ).
cnf(c_0_34,plain,
( less_than(X1,successor(X2))
| ~ less_than(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( less_than(X1,lower_bound)
| ~ less_than(X1,successor(an_index)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_27])]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_32]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SWV019-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n028.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % 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 06:52:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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
% 300.21/100.49 # Version: 3.1.0
% 300.21/100.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 300.21/100.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 300.21/100.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 300.21/100.49 # Starting new_bool_3 with 300s (1) cores
% 300.21/100.49 # Starting new_bool_1 with 300s (1) cores
% 300.21/100.49 # Starting sh5l with 300s (1) cores
% 300.21/100.49 # new_bool_3 with pid 17073 completed with status 0
% 300.21/100.49 # Result found by new_bool_3
% 300.21/100.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 300.21/100.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 300.21/100.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 300.21/100.49 # Starting new_bool_3 with 300s (1) cores
% 300.21/100.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 300.21/100.49 # Search class: FGUSF-FFSF21-SFFFFFNN
% 300.21/100.49 # partial match(1): FGHSF-FFSF21-SFFFFFNN
% 300.21/100.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 300.21/100.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 300.21/100.49 # SAT001_MinMin_p005000_rr_RG with pid 17078 completed with status 0
% 300.21/100.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 300.21/100.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 300.21/100.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 300.21/100.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 300.21/100.49 # Starting new_bool_3 with 300s (1) cores
% 300.21/100.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 300.21/100.49 # Search class: FGUSF-FFSF21-SFFFFFNN
% 300.21/100.49 # partial match(1): FGHSF-FFSF21-SFFFFFNN
% 300.21/100.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 300.21/100.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 300.21/100.49 # Preprocessing time : 0.001 s
% 300.21/100.49 # Presaturation interreduction done
% 300.21/100.49
% 300.21/100.49 # Proof found!
% 300.21/100.49 # SZS status Unsatisfiable
% 300.21/100.49 # SZS output start CNFRefutation
% See solution above
% 300.21/100.49 # Parsed axioms : 10
% 300.21/100.49 # Removed by relevancy pruning/SinE : 0
% 300.21/100.49 # Initial clauses : 10
% 300.21/100.49 # Removed in clause preprocessing : 0
% 300.21/100.49 # Initial clauses in saturation : 10
% 300.21/100.49 # Processed clauses : 29
% 300.21/100.49 # ...of these trivial : 0
% 300.21/100.49 # ...subsumed : 0
% 300.21/100.49 # ...remaining for further processing : 29
% 300.21/100.49 # Other redundant clauses eliminated : 0
% 300.21/100.49 # Clauses deleted for lack of memory : 0
% 300.21/100.49 # Backward-subsumed : 3
% 300.21/100.49 # Backward-rewritten : 0
% 300.21/100.49 # Generated clauses : 15
% 300.21/100.49 # ...of the previous two non-redundant : 12
% 300.21/100.49 # ...aggressively subsumed : 0
% 300.21/100.49 # Contextual simplify-reflections : 1
% 300.21/100.49 # Paramodulations : 15
% 300.21/100.49 # Factorizations : 0
% 300.21/100.49 # NegExts : 0
% 300.21/100.49 # Equation resolutions : 0
% 300.21/100.49 # Disequality decompositions : 0
% 300.21/100.49 # Total rewrite steps : 2
% 300.21/100.49 # ...of those cached : 0
% 300.21/100.49 # Propositional unsat checks : 0
% 300.21/100.49 # Propositional check models : 0
% 300.21/100.49 # Propositional check unsatisfiable : 0
% 300.21/100.49 # Propositional clauses : 0
% 300.21/100.49 # Propositional clauses after purity: 0
% 300.21/100.49 # Propositional unsat core size : 0
% 300.21/100.49 # Propositional preprocessing time : 0.000
% 300.21/100.49 # Propositional encoding time : 0.000
% 300.21/100.49 # Propositional solver time : 0.000
% 300.21/100.49 # Success case prop preproc time : 0.000
% 300.21/100.49 # Success case prop encoding time : 0.000
% 300.21/100.49 # Success case prop solver time : 0.000
% 300.21/100.49 # Current number of processed clauses : 16
% 300.21/100.49 # Positive orientable unit clauses : 2
% 300.21/100.49 # Positive unorientable unit clauses: 0
% 300.21/100.49 # Negative unit clauses : 4
% 300.21/100.49 # Non-unit-clauses : 10
% 300.21/100.49 # Current number of unprocessed clauses: 2
% 300.21/100.49 # ...number of literals in the above : 5
% 300.21/100.49 # Current number of archived formulas : 0
% 300.21/100.49 # Current number of archived clauses : 13
% 300.21/100.49 # Clause-clause subsumption calls (NU) : 28
% 300.21/100.49 # Rec. Clause-clause subsumption calls : 23
% 300.21/100.49 # Non-unit clause-clause subsumptions : 4
% 300.21/100.49 # Unit Clause-clause subsumption calls : 7
% 300.21/100.49 # Rewrite failures with RHS unbound : 0
% 300.21/100.49 # BW rewrite match attempts : 2
% 300.21/100.49 # BW rewrite match successes : 0
% 300.21/100.49 # Condensation attempts : 0
% 300.21/100.49 # Condensation successes : 0
% 300.21/100.49 # Termbank termtop insertions : 489
% 300.21/100.49 # Search garbage collected termcells : 25
% 300.21/100.49
% 300.21/100.49 # -------------------------------------------------
% 300.21/100.49 # User time : 0.003 s
% 300.21/100.49 # System time : 0.002 s
% 300.21/100.49 # Total time : 0.005 s
% 300.21/100.49 # Maximum resident set size: 1780 pages
% 300.21/100.49
% 300.21/100.49 # -------------------------------------------------
% 300.21/100.49 # User time : 0.006 s
% 300.21/100.49 # System time : 0.003 s
% 300.21/100.49 # Total time : 0.009 s
% 300.21/100.49 # Maximum resident set size: 1696 pages
% 300.21/100.49 % E---3.1 exiting
% 300.21/100.49 % E exiting
%------------------------------------------------------------------------------