TSTP Solution File: SWV135+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV135+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:43:31 EDT 2023
% Result : Theorem 0.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 6 unt; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 44 ( 10 ~; 7 |; 23 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn; 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(gauss_array_0005,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(n0,pv1325) ),
file('/export/starexec/sandbox/tmp/tmp.qUH53yHo5e/E---3.1_16768.p',gauss_array_0005) ).
fof(transitivity_leq,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.qUH53yHo5e/E---3.1_16768.p',transitivity_leq) ).
fof(leq_gt1,axiom,
! [X1,X2] :
( gt(X2,X1)
=> leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.qUH53yHo5e/E---3.1_16768.p',leq_gt1) ).
fof(gt_2_0,axiom,
gt(n2,n0),
file('/export/starexec/sandbox/tmp/tmp.qUH53yHo5e/E---3.1_16768.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(n0,pv1325) ),
inference(assume_negation,[status(cth)],[gauss_array_0005]) ).
fof(c_0_5,plain,
! [X29,X30,X31] :
( ~ leq(X29,X30)
| ~ leq(X30,X31)
| leq(X29,X31) ),
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(n0,pv1325) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
fof(c_0_7,plain,
! [X32,X33] :
( ~ gt(X33,X32)
| leq(X32,X33) ),
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.00/0.10 % Problem : SWV135+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n016.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Oct 3 03:43:07 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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.qUH53yHo5e/E---3.1_16768.p
% 0.17/0.45 # Version: 3.1pre001
% 0.17/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # new_bool_3 with pid 16847 completed with status 0
% 0.17/0.45 # Result found by new_bool_3
% 0.17/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.45 # Search class: FGUSM-FFMM21-MFFFFFNN
% 0.17/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.45 # SAT001_MinMin_p005000_rr_RG with pid 16851 completed with status 0
% 0.17/0.45 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.45 # Search class: FGUSM-FFMM21-MFFFFFNN
% 0.17/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.45 # Preprocessing time : 0.001 s
% 0.17/0.45 # Presaturation interreduction done
% 0.17/0.45
% 0.17/0.45 # Proof found!
% 0.17/0.45 # SZS status Theorem
% 0.17/0.45 # SZS output start CNFRefutation
% See solution above
% 0.17/0.45 # Parsed axioms : 85
% 0.17/0.45 # Removed by relevancy pruning/SinE : 29
% 0.17/0.45 # Initial clauses : 66
% 0.17/0.45 # Removed in clause preprocessing : 0
% 0.17/0.45 # Initial clauses in saturation : 66
% 0.17/0.45 # Processed clauses : 293
% 0.17/0.45 # ...of these trivial : 0
% 0.17/0.45 # ...subsumed : 72
% 0.17/0.45 # ...remaining for further processing : 221
% 0.17/0.45 # Other redundant clauses eliminated : 0
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 0
% 0.17/0.45 # Backward-rewritten : 0
% 0.17/0.45 # Generated clauses : 408
% 0.17/0.45 # ...of the previous two non-redundant : 291
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 0
% 0.17/0.45 # Paramodulations : 406
% 0.17/0.45 # Factorizations : 2
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 0
% 0.17/0.45 # Total rewrite steps : 283
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.45 # Propositional preprocessing time : 0.000
% 0.17/0.45 # Propositional encoding time : 0.000
% 0.17/0.45 # Propositional solver time : 0.000
% 0.17/0.45 # Success case prop preproc time : 0.000
% 0.17/0.45 # Success case prop encoding time : 0.000
% 0.17/0.45 # Success case prop solver time : 0.000
% 0.17/0.45 # Current number of processed clauses : 155
% 0.17/0.45 # Positive orientable unit clauses : 69
% 0.17/0.45 # Positive unorientable unit clauses: 0
% 0.17/0.45 # Negative unit clauses : 44
% 0.17/0.45 # Non-unit-clauses : 42
% 0.17/0.45 # Current number of unprocessed clauses: 130
% 0.17/0.45 # ...number of literals in the above : 318
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 66
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 117
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 73
% 0.17/0.45 # Non-unit clause-clause subsumptions : 4
% 0.17/0.45 # Unit Clause-clause subsumption calls : 341
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 16
% 0.17/0.45 # BW rewrite match successes : 0
% 0.17/0.45 # Condensation attempts : 0
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 6734
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.012 s
% 0.17/0.45 # System time : 0.000 s
% 0.17/0.45 # Total time : 0.012 s
% 0.17/0.45 # Maximum resident set size: 1904 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.015 s
% 0.17/0.45 # System time : 0.002 s
% 0.17/0.45 # Total time : 0.017 s
% 0.17/0.45 # Maximum resident set size: 1788 pages
% 0.17/0.45 % E---3.1 exiting
% 0.17/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------