TSTP Solution File: SWV181+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV181+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.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:29 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 8 unt; 0 def)
% Number of atoms : 147 ( 28 equ)
% Maximal formula atoms : 31 ( 6 avg)
% Number of connectives : 161 ( 38 ~; 35 |; 53 &)
% ( 1 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 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 : 45 ( 0 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_init_0081,conjecture,
( ( leq(tptp_float_0_001,pv76)
& leq(n1,loopcounter)
& gt(n1,loopcounter)
& ! [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_select3(center_init,X4,n0) = init )
& ( gt(loopcounter,n0)
=> ! [X20] :
( ( leq(n0,X20)
& leq(X20,n4) )
=> a_select2(mu_init,X20) = init ) )
& ( gt(loopcounter,n0)
=> ! [X21] :
( ( leq(n0,X21)
& leq(X21,n4) )
=> a_select2(rho_init,X21) = init ) )
& ( gt(loopcounter,n0)
=> ! [X22] :
( ( leq(n0,X22)
& leq(X22,n4) )
=> a_select2(sigma_init,X22) = init ) ) )
=> ! [X28] :
( ( leq(n0,X28)
& leq(X28,n4) )
=> a_select2(muold_init,X28) = init ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',cl5_nebula_init_0081) ).
fof(transitivity_gt,axiom,
! [X1,X2,X3] :
( ( gt(X1,X2)
& gt(X2,X3) )
=> gt(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',transitivity_gt) ).
fof(leq_gt2,axiom,
! [X1,X2] :
( ( leq(X1,X2)
& X1 != X2 )
=> gt(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt2) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(c_0_4,plain,
( epred1_0
<=> ( leq(tptp_float_0_001,pv76)
& leq(n1,loopcounter)
& gt(n1,loopcounter)
& ! [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_select3(center_init,X4,n0) = init )
& ( gt(loopcounter,n0)
=> ! [X20] :
( ( leq(n0,X20)
& leq(X20,n4) )
=> a_select2(mu_init,X20) = init ) )
& ( gt(loopcounter,n0)
=> ! [X21] :
( ( leq(n0,X21)
& leq(X21,n4) )
=> a_select2(rho_init,X21) = init ) )
& ( gt(loopcounter,n0)
=> ! [X22] :
( ( leq(n0,X22)
& leq(X22,n4) )
=> a_select2(sigma_init,X22) = init ) ) ) ),
introduced(definition) ).
fof(c_0_5,plain,
( epred1_0
=> ( leq(tptp_float_0_001,pv76)
& leq(n1,loopcounter)
& gt(n1,loopcounter)
& ! [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_select3(center_init,X4,n0) = init )
& ( gt(loopcounter,n0)
=> ! [X20] :
( ( leq(n0,X20)
& leq(X20,n4) )
=> a_select2(mu_init,X20) = init ) )
& ( gt(loopcounter,n0)
=> ! [X21] :
( ( leq(n0,X21)
& leq(X21,n4) )
=> a_select2(rho_init,X21) = init ) )
& ( gt(loopcounter,n0)
=> ! [X22] :
( ( leq(n0,X22)
& leq(X22,n4) )
=> a_select2(sigma_init,X22) = init ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_4]) ).
fof(c_0_6,negated_conjecture,
~ ( epred1_0
=> ! [X28] :
( ( leq(n0,X28)
& leq(X28,n4) )
=> a_select2(muold_init,X28) = init ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cl5_nebula_init_0081]),c_0_4]) ).
fof(c_0_7,plain,
! [X23,X24,X25,X26,X27,X28] :
( ( leq(tptp_float_0_001,pv76)
| ~ epred1_0 )
& ( leq(n1,loopcounter)
| ~ epred1_0 )
& ( gt(n1,loopcounter)
| ~ epred1_0 )
& ( ~ leq(n0,X23)
| ~ leq(X23,n135299)
| ~ leq(n0,X24)
| ~ leq(X24,n4)
| a_select3(q_init,X23,X24) = init
| ~ epred1_0 )
& ( ~ leq(n0,X25)
| ~ leq(X25,n4)
| a_select3(center_init,X25,n0) = init
| ~ epred1_0 )
& ( ~ gt(loopcounter,n0)
| ~ leq(n0,X26)
| ~ leq(X26,n4)
| a_select2(mu_init,X26) = init
| ~ epred1_0 )
& ( ~ gt(loopcounter,n0)
| ~ leq(n0,X27)
| ~ leq(X27,n4)
| a_select2(rho_init,X27) = init
| ~ epred1_0 )
& ( ~ gt(loopcounter,n0)
| ~ leq(n0,X28)
| ~ leq(X28,n4)
| a_select2(sigma_init,X28) = 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_5])])])])])]) ).
fof(c_0_8,negated_conjecture,
( epred1_0
& leq(n0,esk1_0)
& leq(esk1_0,n4)
& a_select2(muold_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_6])])])])]) ).
fof(c_0_9,plain,
! [X4,X5,X6] :
( ~ gt(X4,X5)
| ~ gt(X5,X6)
| gt(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_gt])]) ).
cnf(c_0_10,plain,
( gt(n1,loopcounter)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ~ leq(X3,X4)
| X3 = X4
| gt(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt2])]) ).
cnf(c_0_13,plain,
( leq(n1,loopcounter)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( gt(X1,X2)
| ~ gt(X3,X2)
| ~ gt(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
gt(n1,loopcounter),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
cnf(c_0_16,plain,
( gt(X1,X2)
| X2 = X1
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
leq(n1,loopcounter),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_11])]) ).
fof(c_0_18,plain,
! [X2] : ~ gt(X2,X2),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[irreflexivity_gt])]) ).
cnf(c_0_19,plain,
( gt(X1,loopcounter)
| ~ gt(X1,n1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( n1 = loopcounter
| gt(loopcounter,n1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
n1 = loopcounter,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_23,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_22]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV181+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 15 08:09:10 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.018 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 24
% 0.24/1.42 # Proof object clause steps : 12
% 0.24/1.42 # Proof object formula steps : 12
% 0.24/1.42 # Proof object conjectures : 4
% 0.24/1.42 # Proof object clause conjectures : 1
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 6
% 0.24/1.42 # Proof object initial formulas used : 4
% 0.24/1.42 # Proof object generating inferences : 3
% 0.24/1.42 # Proof object simplifying inferences : 7
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 92
% 0.24/1.42 # Removed by relevancy pruning/SinE : 29
% 0.24/1.42 # Initial clauses : 76
% 0.24/1.42 # Removed in clause preprocessing : 1
% 0.24/1.42 # Initial clauses in saturation : 75
% 0.24/1.42 # Processed clauses : 317
% 0.24/1.42 # ...of these trivial : 8
% 0.24/1.42 # ...subsumed : 71
% 0.24/1.42 # ...remaining for further processing : 238
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 1
% 0.24/1.42 # Backward-rewritten : 79
% 0.24/1.42 # Generated clauses : 767
% 0.24/1.42 # ...of the previous two non-trivial : 676
% 0.24/1.42 # Contextual simplify-reflections : 10
% 0.24/1.42 # Paramodulations : 765
% 0.24/1.42 # Factorizations : 2
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 158
% 0.24/1.42 # Positive orientable unit clauses : 47
% 0.24/1.42 # Positive unorientable unit clauses: 4
% 0.24/1.42 # Negative unit clauses : 23
% 0.24/1.42 # Non-unit-clauses : 84
% 0.24/1.42 # Current number of unprocessed clauses: 160
% 0.24/1.42 # ...number of literals in the above : 409
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 81
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 320
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 234
% 0.24/1.42 # Non-unit clause-clause subsumptions : 45
% 0.24/1.42 # Unit Clause-clause subsumption calls : 491
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 30
% 0.24/1.42 # BW rewrite match successes : 26
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 10658
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.038 s
% 0.24/1.42 # System time : 0.002 s
% 0.24/1.42 # Total time : 0.040 s
% 0.24/1.42 # Maximum resident set size: 4008 pages
%------------------------------------------------------------------------------