TSTP Solution File: SWV189+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV189+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 11 unt; 0 def)
% Number of atoms : 52 ( 8 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 48 ( 17 ~; 9 |; 12 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-3 aty)
% Number of variables : 28 ( 0 sgn; 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.hOZ7XDyEnP/E---3.1_23695.p',irreflexivity_gt) ).
fof(cl5_nebula_init_0121,conjecture,
( ! [X14] :
( ( leq(n0,X14)
& leq(X14,n4) )
=> a_select3(center_init,X14,n0) = init )
=> ! [X18] :
( ( leq(n0,X18)
& leq(X18,tptp_minus_1) )
=> ! [X4] :
( ( leq(n0,X4)
& leq(X4,n4) )
=> a_select3(q_init,X18,X4) = init ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.hOZ7XDyEnP/E---3.1_23695.p',cl5_nebula_init_0121) ).
fof(leq_succ_gt,axiom,
! [X1,X2] :
( leq(succ(X1),X2)
=> gt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.hOZ7XDyEnP/E---3.1_23695.p',leq_succ_gt) ).
fof(transitivity_leq,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.hOZ7XDyEnP/E---3.1_23695.p',transitivity_leq) ).
fof(succ_tptp_minus_1,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox2/tmp/tmp.hOZ7XDyEnP/E---3.1_23695.p',succ_tptp_minus_1) ).
fof(c_0_5,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
fof(c_0_6,negated_conjecture,
~ ( ! [X14] :
( ( leq(n0,X14)
& leq(X14,n4) )
=> a_select3(center_init,X14,n0) = init )
=> ! [X18] :
( ( leq(n0,X18)
& leq(X18,tptp_minus_1) )
=> ! [X4] :
( ( leq(n0,X4)
& leq(X4,n4) )
=> a_select3(q_init,X18,X4) = init ) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_init_0121]) ).
fof(c_0_7,plain,
! [X57] : ~ gt(X57,X57),
inference(variable_rename,[status(thm)],[c_0_5]) ).
fof(c_0_8,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_9,plain,
! [X32,X33,X34] :
( ~ leq(X32,X33)
| ~ leq(X33,X34)
| leq(X32,X34) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_leq])]) ).
fof(c_0_10,negated_conjecture,
! [X28] :
( ( ~ leq(n0,X28)
| ~ leq(X28,n4)
| a_select3(center_init,X28,n0) = init )
& leq(n0,esk1_0)
& leq(esk1_0,tptp_minus_1)
& leq(n0,esk2_0)
& leq(esk2_0,n4)
& a_select3(q_init,esk1_0,esk2_0) != init ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_11,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( gt(X2,X1)
| ~ leq(succ(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( leq(X1,X3)
| ~ leq(X1,X2)
| ~ leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
leq(esk1_0,tptp_minus_1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
~ leq(succ(X1),X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[succ_tptp_minus_1]) ).
cnf(c_0_17,negated_conjecture,
( leq(X1,tptp_minus_1)
| ~ leq(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
~ leq(n0,tptp_minus_1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV189+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 04:02:34 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 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.hOZ7XDyEnP/E---3.1_23695.p
% 0.19/0.50 # Version: 3.1pre001
% 0.19/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # new_bool_3 with pid 23774 completed with status 0
% 0.19/0.50 # Result found by new_bool_3
% 0.19/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FGUSM-FFMM32-MFFFFFNN
% 0.19/0.50 # partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.19/0.50 # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 23777 completed with status 0
% 0.19/0.50 # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 0.19/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FGUSM-FFMM32-MFFFFFNN
% 0.19/0.50 # partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.19/0.50 # Preprocessing time : 0.002 s
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Theorem
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 85
% 0.19/0.50 # Removed by relevancy pruning/SinE : 29
% 0.19/0.50 # Initial clauses : 63
% 0.19/0.50 # Removed in clause preprocessing : 0
% 0.19/0.50 # Initial clauses in saturation : 63
% 0.19/0.50 # Processed clauses : 129
% 0.19/0.50 # ...of these trivial : 0
% 0.19/0.50 # ...subsumed : 8
% 0.19/0.50 # ...remaining for further processing : 121
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 0
% 0.19/0.50 # Backward-rewritten : 0
% 0.19/0.50 # Generated clauses : 222
% 0.19/0.50 # ...of the previous two non-redundant : 181
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 0
% 0.19/0.50 # Paramodulations : 216
% 0.19/0.50 # Factorizations : 6
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 0
% 0.19/0.50 # Total rewrite steps : 115
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 121
% 0.19/0.50 # Positive orientable unit clauses : 64
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 35
% 0.19/0.50 # Non-unit-clauses : 22
% 0.19/0.50 # Current number of unprocessed clauses: 115
% 0.19/0.50 # ...number of literals in the above : 264
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 0
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 32
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 2
% 0.19/0.50 # Non-unit clause-clause subsumptions : 0
% 0.19/0.50 # Unit Clause-clause subsumption calls : 398
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 4
% 0.19/0.50 # BW rewrite match successes : 0
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 5358
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.010 s
% 0.19/0.50 # System time : 0.002 s
% 0.19/0.50 # Total time : 0.012 s
% 0.19/0.50 # Maximum resident set size: 1912 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.012 s
% 0.19/0.50 # System time : 0.004 s
% 0.19/0.50 # Total time : 0.016 s
% 0.19/0.50 # Maximum resident set size: 1788 pages
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------