TSTP Solution File: SWV136+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV136+1 : TPTP v8.1.2. Bugfixed v3.3.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 : Sat May 4 09:42:57 EDT 2024
% Result : Theorem 0.21s 0.55s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 6 unt; 0 def)
% Number of atoms : 53 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 47 ( 10 ~; 7 |; 26 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(gauss_array_0006,conjecture,
( ( leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n2,pv1325)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv1325,n3)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7)) )
=> leq(n0,pv1325) ),
file('/export/starexec/sandbox/tmp/tmp.hbo8dfWaDX/E---3.1_21160.p',gauss_array_0006) ).
fof(transitivity_leq,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.hbo8dfWaDX/E---3.1_21160.p',transitivity_leq) ).
fof(leq_gt1,axiom,
! [X1,X2] :
( gt(X2,X1)
=> leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.hbo8dfWaDX/E---3.1_21160.p',leq_gt1) ).
fof(gt_2_0,axiom,
gt(n2,n0),
file('/export/starexec/sandbox/tmp/tmp.hbo8dfWaDX/E---3.1_21160.p',gt_2_0) ).
fof(c_0_4,negated_conjecture,
~ ( ( leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n2,pv1325)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv1325,n3)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7)) )
=> leq(n0,pv1325) ),
inference(assume_negation,[status(cth)],[gauss_array_0006]) ).
fof(c_0_5,plain,
! [X29,X30,X31] :
( ~ leq(X29,X30)
| ~ leq(X30,X31)
| leq(X29,X31) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_leq])])]) ).
fof(c_0_6,negated_conjecture,
( leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n2,pv1325)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv1325,n3)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& ~ leq(n0,pv1325) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
fof(c_0_7,plain,
! [X32,X33] :
( ~ gt(X33,X32)
| leq(X32,X33) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt1])])]) ).
cnf(c_0_8,plain,
( leq(X1,X3)
| ~ leq(X1,X2)
| ~ leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
leq(n2,pv1325),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( leq(X2,X1)
| ~ gt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
gt(n2,n0),
inference(split_conjunct,[status(thm)],[gt_2_0]) ).
cnf(c_0_12,negated_conjecture,
~ leq(n0,pv1325),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
( leq(X1,pv1325)
| ~ leq(X1,n2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
leq(n0,n2),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWV136+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.14/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n026.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 : Fri May 3 16:51:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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/tmp/tmp.hbo8dfWaDX/E---3.1_21160.p
% 0.21/0.55 # Version: 3.1.0
% 0.21/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55 # Starting sh5l with 300s (1) cores
% 0.21/0.55 # new_bool_3 with pid 21248 completed with status 0
% 0.21/0.55 # Result found by new_bool_3
% 0.21/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.55 # Search class: FGUSM-FFMM21-MFFFFFNN
% 0.21/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.55 # SAT001_MinMin_p005000_rr_RG with pid 21252 completed with status 0
% 0.21/0.55 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.55 # Search class: FGUSM-FFMM21-MFFFFFNN
% 0.21/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.55 # Preprocessing time : 0.002 s
% 0.21/0.55 # Presaturation interreduction done
% 0.21/0.55
% 0.21/0.55 # Proof found!
% 0.21/0.55 # SZS status Theorem
% 0.21/0.55 # SZS output start CNFRefutation
% See solution above
% 0.21/0.55 # Parsed axioms : 85
% 0.21/0.55 # Removed by relevancy pruning/SinE : 29
% 0.21/0.55 # Initial clauses : 67
% 0.21/0.55 # Removed in clause preprocessing : 0
% 0.21/0.55 # Initial clauses in saturation : 67
% 0.21/0.55 # Processed clauses : 293
% 0.21/0.55 # ...of these trivial : 0
% 0.21/0.55 # ...subsumed : 71
% 0.21/0.55 # ...remaining for further processing : 222
% 0.21/0.55 # Other redundant clauses eliminated : 0
% 0.21/0.55 # Clauses deleted for lack of memory : 0
% 0.21/0.55 # Backward-subsumed : 0
% 0.21/0.55 # Backward-rewritten : 0
% 0.21/0.55 # Generated clauses : 390
% 0.21/0.55 # ...of the previous two non-redundant : 274
% 0.21/0.55 # ...aggressively subsumed : 0
% 0.21/0.55 # Contextual simplify-reflections : 0
% 0.21/0.55 # Paramodulations : 388
% 0.21/0.55 # Factorizations : 2
% 0.21/0.55 # NegExts : 0
% 0.21/0.55 # Equation resolutions : 0
% 0.21/0.55 # Disequality decompositions : 0
% 0.21/0.55 # Total rewrite steps : 283
% 0.21/0.55 # ...of those cached : 244
% 0.21/0.55 # Propositional unsat checks : 0
% 0.21/0.55 # Propositional check models : 0
% 0.21/0.55 # Propositional check unsatisfiable : 0
% 0.21/0.55 # Propositional clauses : 0
% 0.21/0.55 # Propositional clauses after purity: 0
% 0.21/0.55 # Propositional unsat core size : 0
% 0.21/0.55 # Propositional preprocessing time : 0.000
% 0.21/0.55 # Propositional encoding time : 0.000
% 0.21/0.55 # Propositional solver time : 0.000
% 0.21/0.55 # Success case prop preproc time : 0.000
% 0.21/0.55 # Success case prop encoding time : 0.000
% 0.21/0.55 # Success case prop solver time : 0.000
% 0.21/0.55 # Current number of processed clauses : 155
% 0.21/0.55 # Positive orientable unit clauses : 70
% 0.21/0.55 # Positive unorientable unit clauses: 0
% 0.21/0.55 # Negative unit clauses : 44
% 0.21/0.55 # Non-unit-clauses : 41
% 0.21/0.55 # Current number of unprocessed clauses: 115
% 0.21/0.55 # ...number of literals in the above : 292
% 0.21/0.55 # Current number of archived formulas : 0
% 0.21/0.55 # Current number of archived clauses : 67
% 0.21/0.55 # Clause-clause subsumption calls (NU) : 137
% 0.21/0.55 # Rec. Clause-clause subsumption calls : 93
% 0.21/0.55 # Non-unit clause-clause subsumptions : 3
% 0.21/0.55 # Unit Clause-clause subsumption calls : 310
% 0.21/0.55 # Rewrite failures with RHS unbound : 0
% 0.21/0.55 # BW rewrite match attempts : 16
% 0.21/0.55 # BW rewrite match successes : 0
% 0.21/0.55 # Condensation attempts : 0
% 0.21/0.55 # Condensation successes : 0
% 0.21/0.55 # Termbank termtop insertions : 6849
% 0.21/0.55 # Search garbage collected termcells : 632
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.018 s
% 0.21/0.55 # System time : 0.004 s
% 0.21/0.55 # Total time : 0.022 s
% 0.21/0.55 # Maximum resident set size: 1904 pages
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.020 s
% 0.21/0.55 # System time : 0.008 s
% 0.21/0.55 # Total time : 0.027 s
% 0.21/0.55 # Maximum resident set size: 1800 pages
% 0.21/0.55 % E---3.1 exiting
% 0.21/0.55 % E exiting
%------------------------------------------------------------------------------