TSTP Solution File: SWV188+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV188+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 13 unt; 0 def)
% Number of atoms : 94 ( 21 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 84 ( 17 ~; 9 |; 30 &)
% ( 1 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 37 ( 0 sgn; 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(leq_succ,axiom,
! [X1,X2] :
( leq(X1,X2)
=> leq(X1,succ(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.7gITj63HIC/E---3.1_700.p',leq_succ) ).
fof(cl5_nebula_init_0116,conjecture,
( ( ! [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,tptp_minus_1) )
=> a_select2(mu_init,X29) = init ) ),
file('/export/starexec/sandbox2/tmp/tmp.7gITj63HIC/E---3.1_700.p',cl5_nebula_init_0116) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.7gITj63HIC/E---3.1_700.p',irreflexivity_gt) ).
fof(succ_tptp_minus_1,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox2/tmp/tmp.7gITj63HIC/E---3.1_700.p',succ_tptp_minus_1) ).
fof(leq_succ_gt,axiom,
! [X1,X2] :
( leq(succ(X1),X2)
=> gt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.7gITj63HIC/E---3.1_700.p',leq_succ_gt) ).
fof(finite_domain_0,axiom,
! [X1] :
( ( leq(n0,X1)
& leq(X1,n0) )
=> X1 = n0 ),
file('/export/starexec/sandbox2/tmp/tmp.7gITj63HIC/E---3.1_700.p',finite_domain_0) ).
fof(c_0_6,plain,
( epred1_0
<=> ( ! [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_7,plain,
! [X39,X40] :
( ~ leq(X39,X40)
| leq(X39,succ(X40)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ])]) ).
fof(c_0_8,negated_conjecture,
~ ( epred1_0
=> ! [X29] :
( ( leq(n0,X29)
& leq(X29,tptp_minus_1) )
=> a_select2(mu_init,X29) = init ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cl5_nebula_init_0116]),c_0_6]) ).
fof(c_0_9,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
cnf(c_0_10,plain,
( leq(X1,succ(X2))
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[succ_tptp_minus_1]) ).
fof(c_0_12,negated_conjecture,
( epred1_0
& leq(n0,esk1_0)
& leq(esk1_0,tptp_minus_1)
& a_select2(mu_init,esk1_0) != init ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_13,plain,
! [X57] : ~ gt(X57,X57),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X45,X46] :
( ~ leq(succ(X45),X46)
| gt(X46,X45) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt])]) ).
fof(c_0_15,plain,
! [X47] :
( ~ leq(n0,X47)
| ~ leq(X47,n0)
| X47 = n0 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_domain_0])]) ).
cnf(c_0_16,plain,
( leq(X1,n0)
| ~ leq(X1,tptp_minus_1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
leq(esk1_0,tptp_minus_1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( gt(X2,X1)
| ~ leq(succ(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( X1 = n0
| ~ leq(n0,X1)
| ~ leq(X1,n0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
leq(esk1_0,n0),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,plain,
~ leq(succ(X1),X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
esk1_0 = n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_25,plain,
~ leq(n0,tptp_minus_1),
inference(spm,[status(thm)],[c_0_23,c_0_11]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWV188+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 02:50:26 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 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.7gITj63HIC/E---3.1_700.p
% 0.21/0.52 # Version: 3.1pre001
% 0.21/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # new_bool_3 with pid 789 completed with status 0
% 0.21/0.52 # Result found by new_bool_3
% 0.21/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FGUSM-FFMM32-MFFFFFNN
% 0.21/0.52 # partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.21/0.52 # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 792 completed with status 0
% 0.21/0.52 # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 0.21/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FGUSM-FFMM32-MFFFFFNN
% 0.21/0.52 # partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.21/0.52 # Preprocessing time : 0.003 s
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Theorem
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 92
% 0.21/0.52 # Removed by relevancy pruning/SinE : 29
% 0.21/0.52 # Initial clauses : 74
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 74
% 0.21/0.52 # Processed clauses : 131
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 6
% 0.21/0.52 # ...remaining for further processing : 125
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 1
% 0.21/0.52 # Backward-rewritten : 4
% 0.21/0.52 # Generated clauses : 216
% 0.21/0.52 # ...of the previous two non-redundant : 182
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 214
% 0.21/0.52 # Factorizations : 2
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Total rewrite steps : 112
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 120
% 0.21/0.52 # Positive orientable unit clauses : 68
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 28
% 0.21/0.52 # Non-unit-clauses : 24
% 0.21/0.52 # Current number of unprocessed clauses: 124
% 0.21/0.52 # ...number of literals in the above : 263
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 5
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 80
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 40
% 0.21/0.52 # Non-unit clause-clause subsumptions : 0
% 0.21/0.52 # Unit Clause-clause subsumption calls : 248
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 3
% 0.21/0.52 # BW rewrite match successes : 1
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 5910
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.009 s
% 0.21/0.52 # System time : 0.005 s
% 0.21/0.52 # Total time : 0.014 s
% 0.21/0.52 # Maximum resident set size: 2096 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.013 s
% 0.21/0.52 # System time : 0.006 s
% 0.21/0.52 # Total time : 0.019 s
% 0.21/0.52 # Maximum resident set size: 1800 pages
% 0.21/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------