TSTP Solution File: SWV181+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV181+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:43:39 EDT 2023
% Result : Theorem 0.18s 0.48s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 43 ( 17 unt; 0 def)
% Number of atoms : 178 ( 30 equ)
% Maximal formula atoms : 31 ( 4 avg)
% Number of connectives : 186 ( 51 ~; 43 |; 54 &)
% ( 2 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 15 con; 0-3 aty)
% Number of variables : 63 ( 0 sgn; 49 !; 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/sandbox/tmp/tmp.FGBetoryj7/E---3.1_25452.p',cl5_nebula_init_0081) ).
fof(leq_succ_gt_equiv,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> gt(succ(X2),X1) ),
file('/export/starexec/sandbox/tmp/tmp.FGBetoryj7/E---3.1_25452.p',leq_succ_gt_equiv) ).
fof(successor_1,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/tmp/tmp.FGBetoryj7/E---3.1_25452.p',successor_1) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.FGBetoryj7/E---3.1_25452.p',irreflexivity_gt) ).
fof(finite_domain_0,axiom,
! [X1] :
( ( leq(n0,X1)
& leq(X1,n0) )
=> X1 = n0 ),
file('/export/starexec/sandbox/tmp/tmp.FGBetoryj7/E---3.1_25452.p',finite_domain_0) ).
fof(transitivity_leq,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.FGBetoryj7/E---3.1_25452.p',transitivity_leq) ).
fof(leq_gt1,axiom,
! [X1,X2] :
( gt(X2,X1)
=> leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.FGBetoryj7/E---3.1_25452.p',leq_gt1) ).
fof(leq_succ_gt,axiom,
! [X1,X2] :
( leq(succ(X1),X2)
=> gt(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.FGBetoryj7/E---3.1_25452.p',leq_succ_gt) ).
fof(gt_1_0,axiom,
gt(n1,n0),
file('/export/starexec/sandbox/tmp/tmp.FGBetoryj7/E---3.1_25452.p',gt_1_0) ).
fof(c_0_9,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_10,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_9]) ).
fof(c_0_11,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_9]) ).
fof(c_0_12,plain,
! [X40,X41] :
( ( ~ leq(X40,X41)
| gt(succ(X41),X40) )
& ( ~ gt(succ(X41),X40)
| leq(X40,X41) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt_equiv])]) ).
fof(c_0_13,plain,
! [X69,X70,X71,X72,X73,X74] :
( ( leq(tptp_float_0_001,pv76)
| ~ epred1_0 )
& ( leq(n1,loopcounter)
| ~ epred1_0 )
& ( gt(n1,loopcounter)
| ~ epred1_0 )
& ( ~ leq(n0,X69)
| ~ leq(X69,n135299)
| ~ leq(n0,X70)
| ~ leq(X70,n4)
| a_select3(q_init,X69,X70) = init
| ~ epred1_0 )
& ( ~ leq(n0,X71)
| ~ leq(X71,n4)
| a_select3(center_init,X71,n0) = init
| ~ epred1_0 )
& ( ~ gt(loopcounter,n0)
| ~ leq(n0,X72)
| ~ leq(X72,n4)
| a_select2(mu_init,X72) = init
| ~ epred1_0 )
& ( ~ gt(loopcounter,n0)
| ~ leq(n0,X73)
| ~ leq(X73,n4)
| a_select2(rho_init,X73) = init
| ~ epred1_0 )
& ( ~ gt(loopcounter,n0)
| ~ leq(n0,X74)
| ~ leq(X74,n4)
| a_select2(sigma_init,X74) = init
| ~ epred1_0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_14,negated_conjecture,
( epred1_0
& leq(n0,esk1_0)
& leq(esk1_0,n4)
& a_select2(muold_init,esk1_0) != init ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
cnf(c_0_15,plain,
( leq(X2,X1)
| ~ gt(succ(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
succ(n0) = n1,
inference(split_conjunct,[status(thm)],[successor_1]) ).
cnf(c_0_17,plain,
( gt(n1,loopcounter)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
fof(c_0_20,plain,
! [X46] :
( ~ leq(n0,X46)
| ~ leq(X46,n0)
| X46 = n0 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_domain_0])]) ).
cnf(c_0_21,plain,
( leq(X1,n0)
| ~ gt(n1,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
gt(n1,loopcounter),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
fof(c_0_23,plain,
! [X31,X32,X33] :
( ~ leq(X31,X32)
| ~ leq(X32,X33)
| leq(X31,X33) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_leq])]) ).
cnf(c_0_24,plain,
( leq(n1,loopcounter)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_25,plain,
! [X34,X35] :
( ~ gt(X35,X34)
| leq(X34,X35) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt1])]) ).
fof(c_0_26,plain,
! [X56] : ~ gt(X56,X56),
inference(variable_rename,[status(thm)],[c_0_19]) ).
fof(c_0_27,plain,
! [X44,X45] :
( ~ leq(succ(X44),X45)
| gt(X45,X44) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt])]) ).
cnf(c_0_28,plain,
( X1 = n0
| ~ leq(n0,X1)
| ~ leq(X1,n0) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
leq(loopcounter,n0),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,plain,
( leq(X1,X3)
| ~ leq(X1,X2)
| ~ leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
leq(n1,loopcounter),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_18])]) ).
cnf(c_0_32,plain,
( leq(X2,X1)
| ~ gt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,plain,
gt(n1,n0),
inference(split_conjunct,[status(thm)],[gt_1_0]) ).
cnf(c_0_34,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_35,plain,
( gt(X2,X1)
| ~ leq(succ(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,plain,
( loopcounter = n0
| ~ leq(n0,loopcounter) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
( leq(X1,loopcounter)
| ~ leq(X1,n1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
leq(n0,n1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,plain,
~ leq(succ(X1),X1),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
loopcounter = n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_41,plain,
~ leq(n1,n0),
inference(spm,[status(thm)],[c_0_39,c_0_16]) ).
cnf(c_0_42,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_40]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWV181+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Oct 3 03:44:24 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 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.FGBetoryj7/E---3.1_25452.p
% 0.18/0.48 # Version: 3.1pre001
% 0.18/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48 # Starting sh5l with 300s (1) cores
% 0.18/0.48 # new_bool_3 with pid 25532 completed with status 0
% 0.18/0.48 # Result found by new_bool_3
% 0.18/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.48 # Search class: FGUSM-FFMM32-MFFFFFNN
% 0.18/0.48 # partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.18/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.18/0.48 # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 25536 completed with status 0
% 0.18/0.48 # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 0.18/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.48 # Search class: FGUSM-FFMM32-MFFFFFNN
% 0.18/0.48 # partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.18/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.18/0.48 # Preprocessing time : 0.004 s
% 0.18/0.48
% 0.18/0.48 # Proof found!
% 0.18/0.48 # SZS status Theorem
% 0.18/0.48 # SZS output start CNFRefutation
% See solution above
% 0.18/0.48 # Parsed axioms : 92
% 0.18/0.48 # Removed by relevancy pruning/SinE : 29
% 0.18/0.48 # Initial clauses : 76
% 0.18/0.48 # Removed in clause preprocessing : 0
% 0.18/0.48 # Initial clauses in saturation : 76
% 0.18/0.48 # Processed clauses : 460
% 0.18/0.48 # ...of these trivial : 2
% 0.18/0.48 # ...subsumed : 201
% 0.18/0.48 # ...remaining for further processing : 257
% 0.18/0.48 # Other redundant clauses eliminated : 0
% 0.18/0.48 # Clauses deleted for lack of memory : 0
% 0.18/0.48 # Backward-subsumed : 0
% 0.18/0.48 # Backward-rewritten : 9
% 0.18/0.48 # Generated clauses : 1046
% 0.18/0.48 # ...of the previous two non-redundant : 807
% 0.18/0.48 # ...aggressively subsumed : 0
% 0.18/0.48 # Contextual simplify-reflections : 0
% 0.18/0.48 # Paramodulations : 1009
% 0.18/0.48 # Factorizations : 37
% 0.18/0.48 # NegExts : 0
% 0.18/0.48 # Equation resolutions : 0
% 0.18/0.48 # Total rewrite steps : 809
% 0.18/0.48 # Propositional unsat checks : 0
% 0.18/0.48 # Propositional check models : 0
% 0.18/0.48 # Propositional check unsatisfiable : 0
% 0.18/0.48 # Propositional clauses : 0
% 0.18/0.48 # Propositional clauses after purity: 0
% 0.18/0.48 # Propositional unsat core size : 0
% 0.18/0.48 # Propositional preprocessing time : 0.000
% 0.18/0.48 # Propositional encoding time : 0.000
% 0.18/0.48 # Propositional solver time : 0.000
% 0.18/0.48 # Success case prop preproc time : 0.000
% 0.18/0.48 # Success case prop encoding time : 0.000
% 0.18/0.48 # Success case prop solver time : 0.000
% 0.18/0.48 # Current number of processed clauses : 248
% 0.18/0.48 # Positive orientable unit clauses : 80
% 0.18/0.48 # Positive unorientable unit clauses: 0
% 0.18/0.48 # Negative unit clauses : 65
% 0.18/0.48 # Non-unit-clauses : 103
% 0.18/0.48 # Current number of unprocessed clauses: 419
% 0.18/0.48 # ...number of literals in the above : 1429
% 0.18/0.48 # Current number of archived formulas : 0
% 0.18/0.48 # Current number of archived clauses : 9
% 0.18/0.48 # Clause-clause subsumption calls (NU) : 671
% 0.18/0.48 # Rec. Clause-clause subsumption calls : 106
% 0.18/0.48 # Non-unit clause-clause subsumptions : 8
% 0.18/0.48 # Unit Clause-clause subsumption calls : 738
% 0.18/0.48 # Rewrite failures with RHS unbound : 0
% 0.18/0.48 # BW rewrite match attempts : 5
% 0.18/0.48 # BW rewrite match successes : 1
% 0.18/0.48 # Condensation attempts : 0
% 0.18/0.48 # Condensation successes : 0
% 0.18/0.48 # Termbank termtop insertions : 14690
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.017 s
% 0.18/0.48 # System time : 0.008 s
% 0.18/0.48 # Total time : 0.025 s
% 0.18/0.48 # Maximum resident set size: 2080 pages
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.020 s
% 0.18/0.48 # System time : 0.010 s
% 0.18/0.48 # Total time : 0.030 s
% 0.18/0.48 # Maximum resident set size: 1800 pages
% 0.18/0.48 % E---3.1 exiting
% 0.18/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------