TSTP Solution File: SWV177+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV177+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 300s
% DateTime : Sat May 4 09:43:04 EDT 2024
% Result : Theorem 0.36s 0.55s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 6 unt; 0 def)
% Number of atoms : 178 ( 38 equ)
% Maximal formula atoms : 47 ( 11 avg)
% Number of connectives : 207 ( 44 ~; 41 |; 80 &)
% ( 1 <=>; 41 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 17 con; 0-3 aty)
% Number of variables : 40 ( 0 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_init_0061,conjecture,
( ( leq(n0,pv40)
& leq(n0,pv45)
& leq(pv40,n4)
& leq(pv45,n135299)
& 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,pred(pv40)) )
=> a_select2(mu_init,X20) = init )
& ! [X21] :
( ( leq(n0,X21)
& leq(X21,pred(pv40)) )
=> a_select2(sigma_init,X21) = init )
& ! [X22] :
( ( leq(n0,X22)
& leq(X22,n4) )
=> a_select3(center_init,X22,n0) = init )
& ( gt(loopcounter,n1)
=> ! [X28] :
( ( leq(n0,X28)
& leq(X28,n4) )
=> a_select2(muold_init,X28) = init ) )
& ( gt(loopcounter,n1)
=> ! [X29] :
( ( leq(n0,X29)
& leq(X29,n4) )
=> a_select2(rhoold_init,X29) = init ) )
& ( gt(loopcounter,n1)
=> ! [X5] :
( ( leq(n0,X5)
& leq(X5,n4) )
=> a_select2(sigmaold_init,X5) = init ) ) )
=> ! [X11] :
( ( leq(n0,X11)
& leq(X11,n4) )
=> a_select2(rhoold_init,X11) = init ) ),
file('/export/starexec/sandbox/tmp/tmp.b6ybyFRlF6/E---3.1_22279.p',cl5_nebula_init_0061) ).
fof(c_0_1,plain,
( epred1_0
<=> ( leq(n0,pv40)
& leq(n0,pv45)
& leq(pv40,n4)
& leq(pv45,n135299)
& 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,pred(pv40)) )
=> a_select2(mu_init,X20) = init )
& ! [X21] :
( ( leq(n0,X21)
& leq(X21,pred(pv40)) )
=> a_select2(sigma_init,X21) = init )
& ! [X22] :
( ( leq(n0,X22)
& leq(X22,n4) )
=> a_select3(center_init,X22,n0) = init )
& ( gt(loopcounter,n1)
=> ! [X28] :
( ( leq(n0,X28)
& leq(X28,n4) )
=> a_select2(muold_init,X28) = init ) )
& ( gt(loopcounter,n1)
=> ! [X29] :
( ( leq(n0,X29)
& leq(X29,n4) )
=> a_select2(rhoold_init,X29) = init ) )
& ( gt(loopcounter,n1)
=> ! [X5] :
( ( leq(n0,X5)
& leq(X5,n4) )
=> a_select2(sigmaold_init,X5) = init ) ) ) ),
introduced(definition) ).
fof(c_0_2,plain,
( epred1_0
=> ( leq(n0,pv40)
& leq(n0,pv45)
& leq(pv40,n4)
& leq(pv45,n135299)
& 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,pred(pv40)) )
=> a_select2(mu_init,X20) = init )
& ! [X21] :
( ( leq(n0,X21)
& leq(X21,pred(pv40)) )
=> a_select2(sigma_init,X21) = init )
& ! [X22] :
( ( leq(n0,X22)
& leq(X22,n4) )
=> a_select3(center_init,X22,n0) = init )
& ( gt(loopcounter,n1)
=> ! [X28] :
( ( leq(n0,X28)
& leq(X28,n4) )
=> a_select2(muold_init,X28) = init ) )
& ( gt(loopcounter,n1)
=> ! [X29] :
( ( leq(n0,X29)
& leq(X29,n4) )
=> a_select2(rhoold_init,X29) = init ) )
& ( gt(loopcounter,n1)
=> ! [X5] :
( ( leq(n0,X5)
& leq(X5,n4) )
=> a_select2(sigmaold_init,X5) = init ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
~ ( epred1_0
=> ! [X11] :
( ( leq(n0,X11)
& leq(X11,n4) )
=> a_select2(rhoold_init,X11) = init ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cl5_nebula_init_0061]),c_0_1]) ).
fof(c_0_4,plain,
! [X74,X75,X76,X77,X78,X79,X80,X81,X82] :
( ( leq(n0,pv40)
| ~ epred1_0 )
& ( leq(n0,pv45)
| ~ epred1_0 )
& ( leq(pv40,n4)
| ~ epred1_0 )
& ( leq(pv45,n135299)
| ~ epred1_0 )
& ( gt(loopcounter,n1)
| ~ epred1_0 )
& ( ~ leq(n0,X74)
| ~ leq(X74,n135299)
| ~ leq(n0,X75)
| ~ leq(X75,n4)
| a_select3(q_init,X74,X75) = init
| ~ epred1_0 )
& ( ~ leq(n0,X76)
| ~ leq(X76,n4)
| a_select2(rho_init,X76) = init
| ~ epred1_0 )
& ( ~ leq(n0,X77)
| ~ leq(X77,pred(pv40))
| a_select2(mu_init,X77) = init
| ~ epred1_0 )
& ( ~ leq(n0,X78)
| ~ leq(X78,pred(pv40))
| a_select2(sigma_init,X78) = init
| ~ epred1_0 )
& ( ~ leq(n0,X79)
| ~ leq(X79,n4)
| a_select3(center_init,X79,n0) = init
| ~ epred1_0 )
& ( ~ gt(loopcounter,n1)
| ~ leq(n0,X80)
| ~ leq(X80,n4)
| a_select2(muold_init,X80) = init
| ~ epred1_0 )
& ( ~ gt(loopcounter,n1)
| ~ leq(n0,X81)
| ~ leq(X81,n4)
| a_select2(rhoold_init,X81) = init
| ~ epred1_0 )
& ( ~ gt(loopcounter,n1)
| ~ leq(n0,X82)
| ~ leq(X82,n4)
| a_select2(sigmaold_init,X82) = init
| ~ epred1_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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(rhoold_init,esk1_0) != init ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,plain,
( gt(loopcounter,n1)
| ~ epred1_0 ),
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,
( a_select2(rhoold_init,X1) = init
| ~ gt(loopcounter,n1)
| ~ leq(n0,X1)
| ~ leq(X1,n4)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
gt(loopcounter,n1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_10,plain,
( a_select2(rhoold_init,X1) = init
| ~ leq(X1,n4)
| ~ leq(n0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7]),c_0_9])]) ).
cnf(c_0_11,negated_conjecture,
leq(esk1_0,n4),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
a_select2(rhoold_init,esk1_0) != init,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SWV177+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.04/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n007.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Fri May 3 17:03:08 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.21/0.52 Running first-order theorem proving
% 0.21/0.52 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.b6ybyFRlF6/E---3.1_22279.p
% 0.36/0.55 # Version: 3.1.0
% 0.36/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.36/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.36/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.36/0.55 # Starting sh5l with 300s (1) cores
% 0.36/0.55 # new_bool_3 with pid 22368 completed with status 0
% 0.36/0.55 # Result found by new_bool_3
% 0.36/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.36/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.36/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.36/0.55 # Search class: FGUSM-FFMM31-MFFFFFNN
% 0.36/0.55 # partial match(1): FGHSM-FFMM31-MFFFFFNN
% 0.36/0.55 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.55 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.36/0.55 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 22371 completed with status 0
% 0.36/0.55 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 0.36/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.36/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.36/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.36/0.55 # Search class: FGUSM-FFMM31-MFFFFFNN
% 0.36/0.55 # partial match(1): FGHSM-FFMM31-MFFFFFNN
% 0.36/0.55 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.55 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.36/0.55 # Preprocessing time : 0.005 s
% 0.36/0.55 # Presaturation interreduction done
% 0.36/0.55
% 0.36/0.55 # Proof found!
% 0.36/0.55 # SZS status Theorem
% 0.36/0.55 # SZS output start CNFRefutation
% See solution above
% 0.36/0.56 # Parsed axioms : 92
% 0.36/0.56 # Removed by relevancy pruning/SinE : 26
% 0.36/0.56 # Initial clauses : 85
% 0.36/0.56 # Removed in clause preprocessing : 0
% 0.36/0.56 # Initial clauses in saturation : 85
% 0.36/0.56 # Processed clauses : 140
% 0.36/0.56 # ...of these trivial : 0
% 0.36/0.56 # ...subsumed : 0
% 0.36/0.56 # ...remaining for further processing : 140
% 0.36/0.56 # Other redundant clauses eliminated : 0
% 0.36/0.56 # Clauses deleted for lack of memory : 0
% 0.36/0.56 # Backward-subsumed : 0
% 0.36/0.56 # Backward-rewritten : 0
% 0.36/0.56 # Generated clauses : 59
% 0.36/0.56 # ...of the previous two non-redundant : 50
% 0.36/0.56 # ...aggressively subsumed : 0
% 0.36/0.56 # Contextual simplify-reflections : 0
% 0.36/0.56 # Paramodulations : 59
% 0.36/0.56 # Factorizations : 0
% 0.36/0.56 # NegExts : 0
% 0.36/0.56 # Equation resolutions : 0
% 0.36/0.56 # Disequality decompositions : 0
% 0.36/0.56 # Total rewrite steps : 36
% 0.36/0.56 # ...of those cached : 21
% 0.36/0.56 # Propositional unsat checks : 0
% 0.36/0.56 # Propositional check models : 0
% 0.36/0.56 # Propositional check unsatisfiable : 0
% 0.36/0.56 # Propositional clauses : 0
% 0.36/0.56 # Propositional clauses after purity: 0
% 0.36/0.56 # Propositional unsat core size : 0
% 0.36/0.56 # Propositional preprocessing time : 0.000
% 0.36/0.56 # Propositional encoding time : 0.000
% 0.36/0.56 # Propositional solver time : 0.000
% 0.36/0.56 # Success case prop preproc time : 0.000
% 0.36/0.56 # Success case prop encoding time : 0.000
% 0.36/0.56 # Success case prop solver time : 0.000
% 0.36/0.56 # Current number of processed clauses : 55
% 0.36/0.56 # Positive orientable unit clauses : 48
% 0.36/0.56 # Positive unorientable unit clauses: 0
% 0.36/0.56 # Negative unit clauses : 2
% 0.36/0.56 # Non-unit-clauses : 5
% 0.36/0.56 # Current number of unprocessed clauses: 80
% 0.36/0.56 # ...number of literals in the above : 140
% 0.36/0.56 # Current number of archived formulas : 0
% 0.36/0.56 # Current number of archived clauses : 85
% 0.36/0.56 # Clause-clause subsumption calls (NU) : 81
% 0.36/0.56 # Rec. Clause-clause subsumption calls : 16
% 0.36/0.56 # Non-unit clause-clause subsumptions : 0
% 0.36/0.56 # Unit Clause-clause subsumption calls : 0
% 0.36/0.56 # Rewrite failures with RHS unbound : 0
% 0.36/0.56 # BW rewrite match attempts : 12
% 0.36/0.56 # BW rewrite match successes : 1
% 0.36/0.56 # Condensation attempts : 0
% 0.36/0.56 # Condensation successes : 0
% 0.36/0.56 # Termbank termtop insertions : 5199
% 0.36/0.56 # Search garbage collected termcells : 849
% 0.36/0.56
% 0.36/0.56 # -------------------------------------------------
% 0.36/0.56 # User time : 0.016 s
% 0.36/0.56 # System time : 0.005 s
% 0.36/0.56 # Total time : 0.022 s
% 0.36/0.56 # Maximum resident set size: 2112 pages
% 0.36/0.56
% 0.36/0.56 # -------------------------------------------------
% 0.36/0.56 # User time : 0.019 s
% 0.36/0.56 # System time : 0.008 s
% 0.36/0.56 # Total time : 0.028 s
% 0.36/0.56 # Maximum resident set size: 1816 pages
% 0.36/0.56 % E---3.1 exiting
% 0.36/0.56 % E exiting
%------------------------------------------------------------------------------