TSTP Solution File: SWV184+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV184+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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:30 EDT 2022
% Result : Theorem 0.24s 1.40s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 6 unt; 0 def)
% Number of atoms : 136 ( 31 equ)
% Maximal formula atoms : 31 ( 8 avg)
% Number of connectives : 157 ( 37 ~; 34 |; 50 &)
% ( 1 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 13 con; 0-3 aty)
% Number of variables : 33 ( 0 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_init_0096,conjecture,
( ( gt(loopcounter,n1)
& ! [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,n4) )
=> a_select2(sigmaold_init,X29) = init ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',cl5_nebula_init_0096) ).
fof(c_0_1,plain,
( epred1_0
<=> ( gt(loopcounter,n1)
& ! [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_2,plain,
( epred1_0
=> ( gt(loopcounter,n1)
& ! [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 ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
~ ( epred1_0
=> ! [X29] :
( ( leq(n0,X29)
& leq(X29,n4) )
=> a_select2(sigmaold_init,X29) = init ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cl5_nebula_init_0096]),c_0_1]) ).
fof(c_0_4,plain,
! [X29,X30,X31,X32,X33,X34,X35] :
( ( gt(loopcounter,n1)
| ~ epred1_0 )
& ( ~ leq(n0,X29)
| ~ leq(X29,n135299)
| ~ leq(n0,X30)
| ~ leq(X30,n4)
| a_select3(q_init,X29,X30) = init
| ~ epred1_0 )
& ( ~ leq(n0,X31)
| ~ leq(X31,n4)
| a_select2(rho_init,X31) = init
| ~ epred1_0 )
& ( ~ leq(n0,X32)
| ~ leq(X32,n4)
| a_select3(center_init,X32,n0) = init
| ~ epred1_0 )
& ( ~ gt(loopcounter,n1)
| ~ leq(n0,X33)
| ~ leq(X33,n4)
| a_select2(muold_init,X33) = init
| ~ epred1_0 )
& ( ~ gt(loopcounter,n1)
| ~ leq(n0,X34)
| ~ leq(X34,n4)
| a_select2(rhoold_init,X34) = init
| ~ epred1_0 )
& ( ~ gt(loopcounter,n1)
| ~ leq(n0,X35)
| ~ leq(X35,n4)
| a_select2(sigmaold_init,X35) = init
| ~ epred1_0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])]) ).
fof(c_0_5,negated_conjecture,
( epred1_0
& leq(n0,esk1_0)
& leq(esk1_0,n4)
& a_select2(sigmaold_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_3])])])])]) ).
cnf(c_0_6,plain,
( a_select2(sigmaold_init,X1) = init
| ~ epred1_0
| ~ leq(X1,n4)
| ~ leq(n0,X1)
| ~ gt(loopcounter,n1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( gt(loopcounter,n1)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( a_select2(sigmaold_init,X1) = init
| ~ leq(X1,n4)
| ~ leq(n0,X1)
| ~ gt(loopcounter,n1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_10,plain,
gt(loopcounter,n1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7])]) ).
cnf(c_0_11,negated_conjecture,
a_select2(sigmaold_init,esk1_0) != init,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( a_select2(sigmaold_init,X1) = init
| ~ leq(X1,n4)
| ~ leq(n0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
cnf(c_0_13,negated_conjecture,
leq(esk1_0,n4),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWV184+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.00/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jun 15 09:50:39 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.24/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.40 # Preprocessing time : 0.017 s
% 0.24/1.40
% 0.24/1.40 # Proof found!
% 0.24/1.40 # SZS status Theorem
% 0.24/1.40 # SZS output start CNFRefutation
% See solution above
% 0.24/1.40 # Proof object total steps : 16
% 0.24/1.40 # Proof object clause steps : 10
% 0.24/1.40 # Proof object formula steps : 6
% 0.24/1.40 # Proof object conjectures : 8
% 0.24/1.40 # Proof object clause conjectures : 5
% 0.24/1.40 # Proof object formula conjectures : 3
% 0.24/1.40 # Proof object initial clauses used : 6
% 0.24/1.40 # Proof object initial formulas used : 1
% 0.24/1.40 # Proof object generating inferences : 1
% 0.24/1.40 # Proof object simplifying inferences : 9
% 0.24/1.40 # Training examples: 0 positive, 0 negative
% 0.24/1.40 # Parsed axioms : 92
% 0.24/1.40 # Removed by relevancy pruning/SinE : 29
% 0.24/1.40 # Initial clauses : 75
% 0.24/1.40 # Removed in clause preprocessing : 1
% 0.24/1.40 # Initial clauses in saturation : 74
% 0.24/1.40 # Processed clauses : 94
% 0.24/1.40 # ...of these trivial : 1
% 0.24/1.40 # ...subsumed : 2
% 0.24/1.40 # ...remaining for further processing : 91
% 0.24/1.40 # Other redundant clauses eliminated : 0
% 0.24/1.40 # Clauses deleted for lack of memory : 0
% 0.24/1.40 # Backward-subsumed : 0
% 0.24/1.40 # Backward-rewritten : 3
% 0.24/1.40 # Generated clauses : 235
% 0.24/1.40 # ...of the previous two non-trivial : 199
% 0.24/1.40 # Contextual simplify-reflections : 6
% 0.24/1.40 # Paramodulations : 233
% 0.24/1.40 # Factorizations : 2
% 0.24/1.40 # Equation resolutions : 0
% 0.24/1.40 # Current number of processed clauses : 88
% 0.24/1.40 # Positive orientable unit clauses : 48
% 0.24/1.40 # Positive unorientable unit clauses: 3
% 0.24/1.40 # Negative unit clauses : 5
% 0.24/1.40 # Non-unit-clauses : 32
% 0.24/1.40 # Current number of unprocessed clauses: 170
% 0.24/1.40 # ...number of literals in the above : 470
% 0.24/1.40 # Current number of archived formulas : 0
% 0.24/1.40 # Current number of archived clauses : 4
% 0.24/1.40 # Clause-clause subsumption calls (NU) : 41
% 0.24/1.40 # Rec. Clause-clause subsumption calls : 19
% 0.24/1.40 # Non-unit clause-clause subsumptions : 8
% 0.24/1.40 # Unit Clause-clause subsumption calls : 6
% 0.24/1.40 # Rewrite failures with RHS unbound : 0
% 0.24/1.40 # BW rewrite match attempts : 12
% 0.24/1.40 # BW rewrite match successes : 10
% 0.24/1.40 # Condensation attempts : 0
% 0.24/1.40 # Condensation successes : 0
% 0.24/1.40 # Termbank termtop insertions : 6273
% 0.24/1.40
% 0.24/1.40 # -------------------------------------------------
% 0.24/1.40 # User time : 0.021 s
% 0.24/1.40 # System time : 0.003 s
% 0.24/1.40 # Total time : 0.024 s
% 0.24/1.40 # Maximum resident set size: 3472 pages
%------------------------------------------------------------------------------