TSTP Solution File: SWV188+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV188+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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:15:31 EDT 2022
% Result : Theorem 0.18s 1.37s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 10 unt; 0 def)
% Number of atoms : 96 ( 20 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 88 ( 17 ~; 12 |; 31 &)
% ( 1 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 15 con; 0-3 aty)
% Number of variables : 38 ( 0 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(leq_gt1,axiom,
! [X1,X2] :
( gt(X2,X1)
=> leq(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
fof(cl5_nebula_init_0116,conjecture,
( ( ! [X14] :
( ( leq(n0,X14)
& leq(X14,n135299) )
=> ! [X18] :
( ( leq(n0,X18)
& leq(X18,n4) )
=> a_select3(q_init,X14,X18) = init ) )
& ! [X4] :
( ( leq(n0,X4)
& leq(X4,n4) )
=> a_select2(rho_init,X4) = init )
& ! [X20] :
( ( leq(n0,X20)
& leq(X20,n4) )
=> a_select3(center_init,X20,n0) = init )
& ( gt(loopcounter,n1)
=> ! [X21] :
( ( leq(n0,X21)
& leq(X21,n4) )
=> a_select2(muold_init,X21) = init ) )
& ( gt(loopcounter,n1)
=> ! [X22] :
( ( leq(n0,X22)
& leq(X22,n4) )
=> a_select2(rhoold_init,X22) = init ) )
& ( gt(loopcounter,n1)
=> ! [X28] :
( ( leq(n0,X28)
& leq(X28,n4) )
=> a_select2(sigmaold_init,X28) = init ) ) )
=> ! [X29] :
( ( leq(n0,X29)
& leq(X29,tptp_minus_1) )
=> a_select2(mu_init,X29) = init ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',cl5_nebula_init_0116) ).
fof(finite_domain_0,axiom,
! [X1] :
( ( leq(n0,X1)
& leq(X1,n0) )
=> X1 = n0 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',finite_domain_0) ).
fof(gt_0_tptp_minus_1,axiom,
gt(n0,tptp_minus_1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',gt_0_tptp_minus_1) ).
fof(transitivity_leq,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(c_0_6,plain,
( epred1_0
<=> ( ! [X14] :
( ( leq(n0,X14)
& leq(X14,n135299) )
=> ! [X18] :
( ( leq(n0,X18)
& leq(X18,n4) )
=> a_select3(q_init,X14,X18) = init ) )
& ! [X4] :
( ( leq(n0,X4)
& leq(X4,n4) )
=> a_select2(rho_init,X4) = init )
& ! [X20] :
( ( leq(n0,X20)
& leq(X20,n4) )
=> a_select3(center_init,X20,n0) = init )
& ( gt(loopcounter,n1)
=> ! [X21] :
( ( leq(n0,X21)
& leq(X21,n4) )
=> a_select2(muold_init,X21) = init ) )
& ( gt(loopcounter,n1)
=> ! [X22] :
( ( leq(n0,X22)
& leq(X22,n4) )
=> a_select2(rhoold_init,X22) = init ) )
& ( gt(loopcounter,n1)
=> ! [X28] :
( ( leq(n0,X28)
& leq(X28,n4) )
=> a_select2(sigmaold_init,X28) = init ) ) ) ),
introduced(definition) ).
fof(c_0_7,plain,
! [X3,X4] :
( ~ gt(X4,X3)
| leq(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt1])]) ).
fof(c_0_8,negated_conjecture,
~ ( epred1_0
=> ! [X29] :
( ( leq(n0,X29)
& leq(X29,tptp_minus_1) )
=> a_select2(mu_init,X29) = init ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cl5_nebula_init_0116]),c_0_6]) ).
fof(c_0_9,plain,
! [X2] :
( ~ leq(n0,X2)
| ~ leq(X2,n0)
| X2 = n0 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_domain_0])]) ).
cnf(c_0_10,plain,
( leq(X1,X2)
| ~ gt(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
gt(n0,tptp_minus_1),
inference(split_conjunct,[status(thm)],[gt_0_tptp_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,
( epred1_0
& leq(n0,esk1_0)
& leq(esk1_0,tptp_minus_1)
& a_select2(mu_init,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,
( X1 = n0
| ~ leq(X1,n0)
| ~ leq(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
leq(tptp_minus_1,n0),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
leq(esk1_0,tptp_minus_1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( n0 = tptp_minus_1
| ~ leq(n0,tptp_minus_1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( leq(X1,tptp_minus_1)
| ~ leq(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_21,plain,
! [X2] : ~ gt(X2,X2),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[irreflexivity_gt])]) ).
cnf(c_0_22,negated_conjecture,
n0 = tptp_minus_1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_23,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SWV188+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.02/0.11 % Command : run_ET %s %d
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Tue Jun 14 21:28:58 EDT 2022
% 0.11/0.30 % CPUTime :
% 0.18/1.37 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.18/1.37 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.18/1.37 # Preprocessing time : 0.011 s
% 0.18/1.37
% 0.18/1.37 # Proof found!
% 0.18/1.37 # SZS status Theorem
% 0.18/1.37 # SZS output start CNFRefutation
% See solution above
% 0.18/1.37 # Proof object total steps : 25
% 0.18/1.37 # Proof object clause steps : 12
% 0.18/1.37 # Proof object formula steps : 13
% 0.18/1.37 # Proof object conjectures : 7
% 0.18/1.37 # Proof object clause conjectures : 4
% 0.18/1.37 # Proof object formula conjectures : 3
% 0.18/1.37 # Proof object initial clauses used : 7
% 0.18/1.37 # Proof object initial formulas used : 6
% 0.18/1.37 # Proof object generating inferences : 4
% 0.18/1.37 # Proof object simplifying inferences : 4
% 0.18/1.37 # Training examples: 0 positive, 0 negative
% 0.18/1.37 # Parsed axioms : 92
% 0.18/1.37 # Removed by relevancy pruning/SinE : 29
% 0.18/1.37 # Initial clauses : 74
% 0.18/1.37 # Removed in clause preprocessing : 1
% 0.18/1.37 # Initial clauses in saturation : 73
% 0.18/1.37 # Processed clauses : 107
% 0.18/1.37 # ...of these trivial : 0
% 0.18/1.37 # ...subsumed : 2
% 0.18/1.37 # ...remaining for further processing : 105
% 0.18/1.37 # Other redundant clauses eliminated : 0
% 0.18/1.37 # Clauses deleted for lack of memory : 0
% 0.18/1.37 # Backward-subsumed : 0
% 0.18/1.37 # Backward-rewritten : 41
% 0.18/1.37 # Generated clauses : 246
% 0.18/1.37 # ...of the previous two non-trivial : 237
% 0.18/1.37 # Contextual simplify-reflections : 3
% 0.18/1.37 # Paramodulations : 244
% 0.18/1.37 # Factorizations : 2
% 0.18/1.37 # Equation resolutions : 0
% 0.18/1.37 # Current number of processed clauses : 64
% 0.18/1.37 # Positive orientable unit clauses : 43
% 0.18/1.37 # Positive unorientable unit clauses: 3
% 0.18/1.37 # Negative unit clauses : 3
% 0.18/1.37 # Non-unit-clauses : 15
% 0.18/1.37 # Current number of unprocessed clauses: 157
% 0.18/1.37 # ...number of literals in the above : 330
% 0.18/1.37 # Current number of archived formulas : 0
% 0.18/1.37 # Current number of archived clauses : 42
% 0.18/1.37 # Clause-clause subsumption calls (NU) : 47
% 0.18/1.37 # Rec. Clause-clause subsumption calls : 20
% 0.18/1.37 # Non-unit clause-clause subsumptions : 5
% 0.18/1.37 # Unit Clause-clause subsumption calls : 15
% 0.18/1.37 # Rewrite failures with RHS unbound : 0
% 0.18/1.37 # BW rewrite match attempts : 14
% 0.18/1.37 # BW rewrite match successes : 12
% 0.18/1.37 # Condensation attempts : 0
% 0.18/1.37 # Condensation successes : 0
% 0.18/1.37 # Termbank termtop insertions : 6433
% 0.18/1.37
% 0.18/1.37 # -------------------------------------------------
% 0.18/1.37 # User time : 0.011 s
% 0.18/1.37 # System time : 0.004 s
% 0.18/1.37 # Total time : 0.014 s
% 0.18/1.37 # Maximum resident set size: 3472 pages
%------------------------------------------------------------------------------