TSTP Solution File: SWV041+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV041+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:17 EDT 2023
% Result : Theorem 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 20 unt; 0 def)
% Number of atoms : 68 ( 12 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 53 ( 19 ~; 11 |; 14 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 11 con; 0-3 aty)
% Number of variables : 38 ( 0 sgn; 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.wIss9ECYTI/E---3.1_15811.p',irreflexivity_gt) ).
fof(gauss_init_0077,conjecture,
( ( geq(minus(n330,n1),n0)
& geq(minus(n410,n1),n0) )
=> ! [X14] :
( ( leq(n0,X14)
& leq(X14,n2) )
=> ! [X18] :
( ( leq(n0,X18)
& leq(X18,minus(n0,n1)) )
=> a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X18,X14) = init ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.wIss9ECYTI/E---3.1_15811.p',gauss_init_0077) ).
fof(leq_succ_gt,axiom,
! [X1,X2] :
( leq(succ(X1),X2)
=> gt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.wIss9ECYTI/E---3.1_15811.p',leq_succ_gt) ).
fof(transitivity_leq,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.wIss9ECYTI/E---3.1_15811.p',transitivity_leq) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox2/tmp/tmp.wIss9ECYTI/E---3.1_15811.p',pred_minus_1) ).
fof(pred_succ,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.wIss9ECYTI/E---3.1_15811.p',pred_succ) ).
fof(leq_succ_succ,axiom,
! [X1,X2] :
( leq(succ(X1),succ(X2))
<=> leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.wIss9ECYTI/E---3.1_15811.p',leq_succ_succ) ).
fof(succ_tptp_minus_1,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox2/tmp/tmp.wIss9ECYTI/E---3.1_15811.p',succ_tptp_minus_1) ).
fof(c_0_8,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
fof(c_0_9,negated_conjecture,
~ ( ( geq(minus(n330,n1),n0)
& geq(minus(n410,n1),n0) )
=> ! [X14] :
( ( leq(n0,X14)
& leq(X14,n2) )
=> ! [X18] :
( ( leq(n0,X18)
& leq(X18,minus(n0,n1)) )
=> a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X18,X14) = init ) ) ),
inference(assume_negation,[status(cth)],[gauss_init_0077]) ).
fof(c_0_10,plain,
! [X71] : ~ gt(X71,X71),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X58,X59] :
( ~ leq(succ(X58),X59)
| gt(X59,X58) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt])]) ).
fof(c_0_12,plain,
! [X45,X46,X47] :
( ~ leq(X45,X46)
| ~ leq(X46,X47)
| leq(X45,X47) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_leq])]) ).
fof(c_0_13,negated_conjecture,
( geq(minus(n330,n1),n0)
& geq(minus(n410,n1),n0)
& leq(n0,esk1_0)
& leq(esk1_0,n2)
& leq(n0,esk2_0)
& leq(esk2_0,minus(n0,n1))
& a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),esk2_0,esk1_0) != init ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_14,plain,
! [X60] : minus(X60,n1) = pred(X60),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
fof(c_0_15,plain,
! [X83] : pred(succ(X83)) = X83,
inference(variable_rename,[status(thm)],[pred_succ]) ).
cnf(c_0_16,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( gt(X2,X1)
| ~ leq(succ(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( leq(X1,X3)
| ~ leq(X1,X2)
| ~ leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
leq(n0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X56,X57] :
( ( ~ leq(succ(X56),succ(X57))
| leq(X56,X57) )
& ( ~ leq(X56,X57)
| leq(succ(X56),succ(X57)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_succ])]) ).
cnf(c_0_21,negated_conjecture,
leq(esk2_0,minus(n0,n1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[succ_tptp_minus_1]) ).
cnf(c_0_25,plain,
~ leq(succ(X1),X1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_26,negated_conjecture,
( leq(X1,esk2_0)
| ~ leq(X1,n0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,plain,
( leq(succ(X1),succ(X2))
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
leq(esk2_0,pred(n0)),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
pred(n0) = tptp_minus_1,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
~ leq(succ(esk2_0),n0),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
( leq(succ(X1),n0)
| ~ leq(X1,tptp_minus_1) ),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_32,negated_conjecture,
leq(esk2_0,tptp_minus_1),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWV041+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n023.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 04:26:37 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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/tmp/tmp.wIss9ECYTI/E---3.1_15811.p
% 0.15/0.45 # Version: 3.1pre001
% 0.15/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # Starting sh5l with 300s (1) cores
% 0.15/0.45 # new_bool_1 with pid 15891 completed with status 0
% 0.15/0.45 # Result found by new_bool_1
% 0.15/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.45 # Search class: FGUSM-FFMM32-MFFFFFNN
% 0.15/0.45 # partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.15/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.15/0.45 # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 15893 completed with status 0
% 0.15/0.45 # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 0.15/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.45 # Search class: FGUSM-FFMM32-MFFFFFNN
% 0.15/0.45 # partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.15/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.15/0.45 # Preprocessing time : 0.002 s
% 0.15/0.45
% 0.15/0.45 # Proof found!
% 0.15/0.45 # SZS status Theorem
% 0.15/0.45 # SZS output start CNFRefutation
% See solution above
% 0.15/0.45 # Parsed axioms : 100
% 0.15/0.45 # Removed by relevancy pruning/SinE : 22
% 0.15/0.45 # Initial clauses : 88
% 0.15/0.45 # Removed in clause preprocessing : 0
% 0.15/0.45 # Initial clauses in saturation : 88
% 0.15/0.45 # Processed clauses : 747
% 0.15/0.45 # ...of these trivial : 26
% 0.15/0.45 # ...subsumed : 363
% 0.15/0.45 # ...remaining for further processing : 358
% 0.15/0.45 # Other redundant clauses eliminated : 0
% 0.15/0.45 # Clauses deleted for lack of memory : 0
% 0.15/0.45 # Backward-subsumed : 4
% 0.15/0.45 # Backward-rewritten : 7
% 0.15/0.45 # Generated clauses : 1488
% 0.15/0.45 # ...of the previous two non-redundant : 1204
% 0.15/0.45 # ...aggressively subsumed : 0
% 0.15/0.45 # Contextual simplify-reflections : 0
% 0.15/0.45 # Paramodulations : 1482
% 0.15/0.45 # Factorizations : 6
% 0.15/0.45 # NegExts : 0
% 0.15/0.45 # Equation resolutions : 0
% 0.15/0.45 # Total rewrite steps : 1084
% 0.15/0.45 # Propositional unsat checks : 0
% 0.15/0.45 # Propositional check models : 0
% 0.15/0.45 # Propositional check unsatisfiable : 0
% 0.15/0.45 # Propositional clauses : 0
% 0.15/0.45 # Propositional clauses after purity: 0
% 0.15/0.45 # Propositional unsat core size : 0
% 0.15/0.45 # Propositional preprocessing time : 0.000
% 0.15/0.45 # Propositional encoding time : 0.000
% 0.15/0.45 # Propositional solver time : 0.000
% 0.15/0.45 # Success case prop preproc time : 0.000
% 0.15/0.45 # Success case prop encoding time : 0.000
% 0.15/0.45 # Success case prop solver time : 0.000
% 0.15/0.45 # Current number of processed clauses : 347
% 0.15/0.45 # Positive orientable unit clauses : 124
% 0.15/0.45 # Positive unorientable unit clauses: 0
% 0.15/0.45 # Negative unit clauses : 123
% 0.15/0.45 # Non-unit-clauses : 100
% 0.15/0.45 # Current number of unprocessed clauses: 532
% 0.15/0.45 # ...number of literals in the above : 1141
% 0.15/0.45 # Current number of archived formulas : 0
% 0.15/0.45 # Current number of archived clauses : 11
% 0.15/0.45 # Clause-clause subsumption calls (NU) : 1079
% 0.15/0.45 # Rec. Clause-clause subsumption calls : 968
% 0.15/0.45 # Non-unit clause-clause subsumptions : 31
% 0.15/0.45 # Unit Clause-clause subsumption calls : 2797
% 0.15/0.45 # Rewrite failures with RHS unbound : 0
% 0.15/0.45 # BW rewrite match attempts : 12
% 0.15/0.45 # BW rewrite match successes : 6
% 0.15/0.45 # Condensation attempts : 0
% 0.15/0.45 # Condensation successes : 0
% 0.15/0.45 # Termbank termtop insertions : 16242
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.026 s
% 0.15/0.45 # System time : 0.001 s
% 0.15/0.45 # Total time : 0.028 s
% 0.15/0.45 # Maximum resident set size: 2100 pages
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.030 s
% 0.15/0.45 # System time : 0.002 s
% 0.15/0.45 # Total time : 0.032 s
% 0.15/0.45 # Maximum resident set size: 1796 pages
% 0.15/0.45 % E---3.1 exiting
% 0.15/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------