TSTP Solution File: SWV069+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWV069+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:33:07 EDT 2024
% Result : Theorem 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 13 unt; 0 def)
% Number of atoms : 45 ( 3 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 39 ( 15 ~; 10 |; 11 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_array_0010,conjecture,
( ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) )
=> ( leq(n0,n0)
& leq(n0,pv10)
& leq(n0,minus(n5,n1))
& leq(pv10,minus(n135300,n1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0010) ).
fof(reflexivity_leq,axiom,
! [X1] : leq(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',reflexivity_leq) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(leq_gt_pred,axiom,
! [X1,X2] :
( leq(X1,pred(X2))
<=> gt(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt_pred) ).
fof(gt_5_0,axiom,
gt(n5,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gt_5_0) ).
fof(c_0_5,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) )
=> ( leq(n0,n0)
& leq(n0,pv10)
& leq(n0,minus(n5,n1))
& leq(pv10,minus(n135300,n1)) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_array_0010]) ).
fof(c_0_6,negated_conjecture,
( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ( ~ leq(n0,n0)
| ~ leq(n0,pv10)
| ~ leq(n0,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1)) ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
fof(c_0_7,plain,
! [X28] : leq(X28,X28),
inference(variable_rename,[status(thm)],[reflexivity_leq]) ).
fof(c_0_8,plain,
! [X50] : minus(X50,n1) = pred(X50),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
cnf(c_0_9,negated_conjecture,
( ~ leq(n0,n0)
| ~ leq(n0,pv10)
| ~ leq(n0,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
leq(n0,pv10),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
leq(pv10,minus(n135300,n1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_14,plain,
! [X70,X71] :
( ( ~ leq(X70,pred(X71))
| gt(X71,X70) )
& ( ~ gt(X71,X70)
| leq(X70,pred(X71)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt_pred])])]) ).
cnf(c_0_15,negated_conjecture,
( ~ leq(n0,pred(n5))
| ~ leq(pv10,pred(n135300)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]),c_0_12])]) ).
cnf(c_0_16,negated_conjecture,
leq(pv10,pred(n135300)),
inference(rw,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_17,plain,
( leq(X2,pred(X1))
| ~ gt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
gt(n5,n0),
inference(split_conjunct,[status(thm)],[gt_5_0]) ).
cnf(c_0_19,negated_conjecture,
~ leq(n0,pred(n5)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
cnf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWV069+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 08:35:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.50 Running first-order model finding
% 0.20/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.53 # Version: 3.1.0
% 0.20/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # sh5l with pid 19802 completed with status 0
% 0.20/0.53 # Result found by sh5l
% 0.20/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.53 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.20/0.53 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.20/0.53 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 19803 completed with status 0
% 0.20/0.53 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 0.20/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.53 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.20/0.53 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.53 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.20/0.53 # Preprocessing time : 0.003 s
% 0.20/0.53 # Presaturation interreduction done
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Theorem
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 92
% 0.20/0.53 # Removed by relevancy pruning/SinE : 22
% 0.20/0.53 # Initial clauses : 75
% 0.20/0.53 # Removed in clause preprocessing : 0
% 0.20/0.53 # Initial clauses in saturation : 75
% 0.20/0.53 # Processed clauses : 133
% 0.20/0.53 # ...of these trivial : 0
% 0.20/0.53 # ...subsumed : 0
% 0.20/0.53 # ...remaining for further processing : 133
% 0.20/0.53 # Other redundant clauses eliminated : 0
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 0
% 0.20/0.53 # Backward-rewritten : 2
% 0.20/0.53 # Generated clauses : 81
% 0.20/0.53 # ...of the previous two non-redundant : 58
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 0
% 0.20/0.53 # Paramodulations : 81
% 0.20/0.53 # Factorizations : 0
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 0
% 0.20/0.53 # Disequality decompositions : 0
% 0.20/0.53 # Total rewrite steps : 27
% 0.20/0.53 # ...of those cached : 10
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 56
% 0.20/0.53 # Positive orientable unit clauses : 46
% 0.20/0.53 # Positive unorientable unit clauses: 0
% 0.20/0.53 # Negative unit clauses : 2
% 0.20/0.53 # Non-unit-clauses : 8
% 0.20/0.53 # Current number of unprocessed clauses: 63
% 0.20/0.53 # ...number of literals in the above : 100
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 77
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 41
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 11
% 0.20/0.53 # Non-unit clause-clause subsumptions : 0
% 0.20/0.53 # Unit Clause-clause subsumption calls : 9
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 4
% 0.20/0.53 # BW rewrite match successes : 2
% 0.20/0.53 # Condensation attempts : 0
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 4381
% 0.20/0.53 # Search garbage collected termcells : 583
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.011 s
% 0.20/0.53 # System time : 0.002 s
% 0.20/0.53 # Total time : 0.013 s
% 0.20/0.53 # Maximum resident set size: 1912 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.016 s
% 0.20/0.53 # System time : 0.004 s
% 0.20/0.53 # Total time : 0.021 s
% 0.20/0.53 # Maximum resident set size: 1816 pages
% 0.20/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------