TSTP Solution File: SWV183+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV183+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:56:18 EDT 2023
% Result : Theorem 0.15s 0.41s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 5 unt; 0 def)
% Number of atoms : 193 ( 50 equ)
% Maximal formula atoms : 51 ( 14 avg)
% Number of connectives : 227 ( 47 ~; 44 |; 85 &)
% ( 1 <=>; 50 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 8 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 : 52 ( 0 sgn; 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_init_0091,conjecture,
( ( gt(loopcounter,n0)
& ! [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_select2(mu_init,X20) = init )
& ! [X21] :
( ( leq(n0,X21)
& leq(X21,n4) )
=> 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(muold_init,X11) = init )
& ! [X16] :
( ( leq(n0,X16)
& leq(X16,n4) )
=> a_select2(rhoold_init,X16) = init )
& ! [X6] :
( ( leq(n0,X6)
& leq(X6,n4) )
=> a_select2(sigmaold_init,X6) = init ) )
=> ! [X19] :
( ( leq(n0,X19)
& leq(X19,n4) )
=> a_select2(mu_init,X19) = init ) ),
file('/export/starexec/sandbox2/tmp/tmp.0F7lfTdM6N/E---3.1_28051.p',cl5_nebula_init_0091) ).
fof(c_0_1,plain,
( epred1_0
<=> ( gt(loopcounter,n0)
& ! [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_select2(mu_init,X20) = init )
& ! [X21] :
( ( leq(n0,X21)
& leq(X21,n4) )
=> 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(muold_init,X11) = init )
& ! [X16] :
( ( leq(n0,X16)
& leq(X16,n4) )
=> a_select2(rhoold_init,X16) = init )
& ! [X6] :
( ( leq(n0,X6)
& leq(X6,n4) )
=> a_select2(sigmaold_init,X6) = init ) ) ),
introduced(definition) ).
fof(c_0_2,plain,
( epred1_0
=> ( gt(loopcounter,n0)
& ! [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_select2(mu_init,X20) = init )
& ! [X21] :
( ( leq(n0,X21)
& leq(X21,n4) )
=> 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(muold_init,X11) = init )
& ! [X16] :
( ( leq(n0,X16)
& leq(X16,n4) )
=> a_select2(rhoold_init,X16) = init )
& ! [X6] :
( ( leq(n0,X6)
& leq(X6,n4) )
=> a_select2(sigmaold_init,X6) = init ) ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
~ ( epred1_0
=> ! [X19] :
( ( leq(n0,X19)
& leq(X19,n4) )
=> a_select2(mu_init,X19) = init ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cl5_nebula_init_0091]),c_0_1]) ).
fof(c_0_4,plain,
! [X70,X71,X72,X73,X74,X75,X76,X77,X78,X79,X80,X81] :
( ( gt(loopcounter,n0)
| ~ epred1_0 )
& ( ~ leq(n0,X70)
| ~ leq(X70,n135299)
| ~ leq(n0,X71)
| ~ leq(X71,n4)
| a_select3(q_init,X70,X71) = init
| ~ epred1_0 )
& ( ~ leq(n0,X72)
| ~ leq(X72,n4)
| a_select2(rho_init,X72) = init
| ~ epred1_0 )
& ( ~ leq(n0,X73)
| ~ leq(X73,n4)
| a_select2(mu_init,X73) = init
| ~ epred1_0 )
& ( ~ leq(n0,X74)
| ~ leq(X74,n4)
| a_select2(sigma_init,X74) = init
| ~ epred1_0 )
& ( ~ leq(n0,X75)
| ~ leq(X75,n4)
| a_select3(center_init,X75,n0) = init
| ~ epred1_0 )
& ( ~ gt(loopcounter,n1)
| ~ leq(n0,X76)
| ~ leq(X76,n4)
| a_select2(muold_init,X76) = init
| ~ epred1_0 )
& ( ~ gt(loopcounter,n1)
| ~ leq(n0,X77)
| ~ leq(X77,n4)
| a_select2(rhoold_init,X77) = init
| ~ epred1_0 )
& ( ~ gt(loopcounter,n1)
| ~ leq(n0,X78)
| ~ leq(X78,n4)
| a_select2(sigmaold_init,X78) = init
| ~ epred1_0 )
& ( ~ leq(n0,X79)
| ~ leq(X79,n4)
| a_select2(muold_init,X79) = init
| ~ epred1_0 )
& ( ~ leq(n0,X80)
| ~ leq(X80,n4)
| a_select2(rhoold_init,X80) = init
| ~ epred1_0 )
& ( ~ leq(n0,X81)
| ~ leq(X81,n4)
| a_select2(sigmaold_init,X81) = init
| ~ epred1_0 ) ),
inference(distribute,[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(mu_init,esk1_0) != init ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( a_select2(mu_init,X1) = init
| ~ leq(n0,X1)
| ~ leq(X1,n4)
| ~ 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,negated_conjecture,
a_select2(mu_init,esk1_0) != init,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( a_select2(mu_init,X1) = init
| ~ leq(X1,n4)
| ~ leq(n0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_10,negated_conjecture,
leq(esk1_0,n4),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWV183+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n009.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Oct 3 04:04:44 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.0F7lfTdM6N/E---3.1_28051.p
% 0.15/0.41 # Version: 3.1pre001
% 0.15/0.41 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 # Starting sh5l with 300s (1) cores
% 0.15/0.41 # new_bool_1 with pid 28132 completed with status 0
% 0.15/0.41 # Result found by new_bool_1
% 0.15/0.41 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FGUSM-FFMM32-MFFFFFNN
% 0.15/0.41 # partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.15/0.41 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.15/0.41 # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 28135 completed with status 0
% 0.15/0.41 # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 0.15/0.41 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FGUSM-FFMM32-MFFFFFNN
% 0.15/0.41 # partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.15/0.41 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.15/0.41 # Preprocessing time : 0.001 s
% 0.15/0.41
% 0.15/0.41 # Proof found!
% 0.15/0.41 # SZS status Theorem
% 0.15/0.41 # SZS output start CNFRefutation
% See solution above
% 0.15/0.41 # Parsed axioms : 92
% 0.15/0.41 # Removed by relevancy pruning/SinE : 29
% 0.15/0.41 # Initial clauses : 80
% 0.15/0.41 # Removed in clause preprocessing : 0
% 0.15/0.41 # Initial clauses in saturation : 80
% 0.15/0.41 # Processed clauses : 40
% 0.15/0.41 # ...of these trivial : 0
% 0.15/0.41 # ...subsumed : 0
% 0.15/0.41 # ...remaining for further processing : 40
% 0.15/0.41 # Other redundant clauses eliminated : 0
% 0.15/0.41 # Clauses deleted for lack of memory : 0
% 0.15/0.41 # Backward-subsumed : 0
% 0.15/0.41 # Backward-rewritten : 0
% 0.15/0.41 # Generated clauses : 1
% 0.15/0.41 # ...of the previous two non-redundant : 0
% 0.15/0.41 # ...aggressively subsumed : 0
% 0.15/0.41 # Contextual simplify-reflections : 0
% 0.15/0.41 # Paramodulations : 1
% 0.15/0.41 # Factorizations : 0
% 0.15/0.41 # NegExts : 0
% 0.15/0.41 # Equation resolutions : 0
% 0.15/0.41 # Total rewrite steps : 5
% 0.15/0.41 # Propositional unsat checks : 0
% 0.15/0.41 # Propositional check models : 0
% 0.15/0.41 # Propositional check unsatisfiable : 0
% 0.15/0.41 # Propositional clauses : 0
% 0.15/0.41 # Propositional clauses after purity: 0
% 0.15/0.41 # Propositional unsat core size : 0
% 0.15/0.41 # Propositional preprocessing time : 0.000
% 0.15/0.41 # Propositional encoding time : 0.000
% 0.15/0.41 # Propositional solver time : 0.000
% 0.15/0.41 # Success case prop preproc time : 0.000
% 0.15/0.41 # Success case prop encoding time : 0.000
% 0.15/0.41 # Success case prop solver time : 0.000
% 0.15/0.41 # Current number of processed clauses : 40
% 0.15/0.41 # Positive orientable unit clauses : 36
% 0.15/0.41 # Positive unorientable unit clauses: 0
% 0.15/0.41 # Negative unit clauses : 2
% 0.15/0.41 # Non-unit-clauses : 2
% 0.15/0.41 # Current number of unprocessed clauses: 40
% 0.15/0.41 # ...number of literals in the above : 115
% 0.15/0.41 # Current number of archived formulas : 0
% 0.15/0.41 # Current number of archived clauses : 0
% 0.15/0.41 # Clause-clause subsumption calls (NU) : 0
% 0.15/0.41 # Rec. Clause-clause subsumption calls : 0
% 0.15/0.41 # Non-unit clause-clause subsumptions : 0
% 0.15/0.41 # Unit Clause-clause subsumption calls : 0
% 0.15/0.41 # Rewrite failures with RHS unbound : 0
% 0.15/0.41 # BW rewrite match attempts : 2
% 0.15/0.41 # BW rewrite match successes : 0
% 0.15/0.41 # Condensation attempts : 0
% 0.15/0.41 # Condensation successes : 0
% 0.15/0.41 # Termbank termtop insertions : 4083
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.004 s
% 0.15/0.41 # System time : 0.002 s
% 0.15/0.41 # Total time : 0.006 s
% 0.15/0.41 # Maximum resident set size: 2096 pages
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.006 s
% 0.15/0.41 # System time : 0.004 s
% 0.15/0.41 # Total time : 0.011 s
% 0.15/0.41 # Maximum resident set size: 1808 pages
% 0.15/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------