TSTP Solution File: SWV041+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV041+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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 : 600s
% DateTime : Wed Jul 20 18:14:58 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 20 unt; 0 def)
% Number of atoms : 66 ( 17 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 49 ( 16 ~; 11 |; 14 &)
% ( 1 <=>; 7 =>; 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 : 18 ( 18 usr; 11 con; 0-3 aty)
% Number of variables : 39 ( 2 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',gauss_init_0077) ).
fof(pred_succ,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
fof(succ_plus_1_r,axiom,
! [X1] : plus(X1,n1) = succ(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(transitivity_leq,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).
fof(succ_tptp_minus_1,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_tptp_minus_1) ).
fof(leq_succ_gt_equiv,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> gt(succ(X2),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_succ_gt_equiv) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(c_0_8,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_9,plain,
! [X2] : pred(succ(X2)) = X2,
inference(variable_rename,[status(thm)],[pred_succ]) ).
fof(c_0_10,plain,
! [X2] : plus(X2,n1) = succ(X2),
inference(variable_rename,[status(thm)],[succ_plus_1_r]) ).
fof(c_0_11,plain,
! [X2] : minus(X2,n1) = pred(X2),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
fof(c_0_12,plain,
! [X4,X5,X6] :
( ~ leq(X4,X5)
| ~ leq(X5,X6)
| leq(X4,X6) ),
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(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).
cnf(c_0_14,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[succ_tptp_minus_1]) ).
fof(c_0_18,plain,
! [X3,X4,X3,X4] :
( ( ~ leq(X3,X4)
| gt(succ(X4),X3) )
& ( ~ gt(succ(X4),X3)
| leq(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt_equiv])])])]) ).
cnf(c_0_19,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
leq(esk2_0,minus(n0,n1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
minus(plus(X1,n1),n1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_22,plain,
plus(tptp_minus_1,n1) = n0,
inference(rw,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_23,plain,
( gt(succ(X1),X2)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( leq(X1,minus(n0,n1))
| ~ leq(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
minus(n0,n1) = tptp_minus_1,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( gt(plus(X1,n1),X2)
| ~ leq(X2,X1) ),
inference(rw,[status(thm)],[c_0_23,c_0_15]) ).
cnf(c_0_27,negated_conjecture,
( leq(X1,tptp_minus_1)
| ~ leq(X1,esk2_0) ),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_28,plain,
! [X2] : ~ gt(X2,X2),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[irreflexivity_gt])]) ).
cnf(c_0_29,negated_conjecture,
( gt(n0,X1)
| ~ leq(X1,esk2_0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_22]) ).
cnf(c_0_30,negated_conjecture,
leq(n0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_31,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV041+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n007.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 : 600
% 0.13/0.34 % DateTime : Wed Jun 15 18:21:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.019 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 33
% 0.23/1.42 # Proof object clause steps : 17
% 0.23/1.42 # Proof object formula steps : 16
% 0.23/1.42 # Proof object conjectures : 9
% 0.23/1.42 # Proof object clause conjectures : 6
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 9
% 0.23/1.42 # Proof object initial formulas used : 8
% 0.23/1.42 # Proof object generating inferences : 4
% 0.23/1.42 # Proof object simplifying inferences : 7
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 100
% 0.23/1.42 # Removed by relevancy pruning/SinE : 22
% 0.23/1.42 # Initial clauses : 88
% 0.23/1.42 # Removed in clause preprocessing : 2
% 0.23/1.42 # Initial clauses in saturation : 86
% 0.23/1.42 # Processed clauses : 613
% 0.23/1.42 # ...of these trivial : 19
% 0.23/1.42 # ...subsumed : 230
% 0.23/1.42 # ...remaining for further processing : 364
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 5
% 0.23/1.42 # Backward-rewritten : 6
% 0.23/1.42 # Generated clauses : 1439
% 0.23/1.42 # ...of the previous two non-trivial : 1109
% 0.23/1.42 # Contextual simplify-reflections : 30
% 0.23/1.42 # Paramodulations : 1437
% 0.23/1.42 # Factorizations : 2
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 353
% 0.23/1.42 # Positive orientable unit clauses : 107
% 0.23/1.42 # Positive unorientable unit clauses: 5
% 0.23/1.42 # Negative unit clauses : 63
% 0.23/1.42 # Non-unit-clauses : 178
% 0.23/1.42 # Current number of unprocessed clauses: 560
% 0.23/1.42 # ...number of literals in the above : 1491
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 13
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 2275
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 1560
% 0.23/1.42 # Non-unit clause-clause subsumptions : 114
% 0.23/1.42 # Unit Clause-clause subsumption calls : 1930
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 15
% 0.23/1.42 # BW rewrite match successes : 15
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 15299
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.051 s
% 0.23/1.42 # System time : 0.005 s
% 0.23/1.42 # Total time : 0.056 s
% 0.23/1.42 # Maximum resident set size: 4524 pages
%------------------------------------------------------------------------------