TSTP Solution File: SWV152+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWV152+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:51:57 EDT 2024
% Result : Theorem 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 11 unt; 0 def)
% Number of atoms : 37 ( 5 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 31 ( 15 ~; 7 |; 5 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-3 aty)
% Number of variables : 23 ( 0 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.PEUbaCizH5/E---3.1_2171.p',irreflexivity_gt) ).
fof(cl5_nebula_norm_0002,conjecture,
! [X14] :
( ( leq(n0,X14)
& leq(X14,tptp_minus_1) )
=> sum(n0,n4,a_select3(q,X14,tptp_sum_index)) = n1 ),
file('/export/starexec/sandbox2/tmp/tmp.PEUbaCizH5/E---3.1_2171.p',cl5_nebula_norm_0002) ).
fof(leq_succ_gt,axiom,
! [X1,X2] :
( leq(succ(X1),X2)
=> gt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.PEUbaCizH5/E---3.1_2171.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.PEUbaCizH5/E---3.1_2171.p',transitivity_leq) ).
fof(succ_tptp_minus_1,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox2/tmp/tmp.PEUbaCizH5/E---3.1_2171.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,tptp_minus_1) )
=> sum(n0,n4,a_select3(q,X14,tptp_sum_index)) = n1 ),
inference(assume_negation,[status(cth)],[cl5_nebula_norm_0002]) ).
fof(c_0_7,plain,
! [X59] : ~ gt(X59,X59),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_5])]) ).
fof(c_0_8,plain,
! [X52,X53] :
( ~ leq(succ(X52),X53)
| gt(X53,X52) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt])])]) ).
fof(c_0_9,plain,
! [X39,X40,X41] :
( ~ leq(X39,X40)
| ~ leq(X40,X41)
| leq(X39,X41) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_leq])])]) ).
fof(c_0_10,negated_conjecture,
( leq(n0,esk1_0)
& leq(esk1_0,tptp_minus_1)
& sum(n0,n4,a_select3(q,esk1_0,tptp_sum_index)) != n1 ),
inference(fof_nnf,[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.13 % Problem : SWV152+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 17:14:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 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.PEUbaCizH5/E---3.1_2171.p
% 0.22/0.51 # Version: 3.1.0
% 0.22/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # new_bool_1 with pid 2252 completed with status 0
% 0.22/0.51 # Result found by new_bool_1
% 0.22/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.51 # Search class: FGUSM-FFMM32-MFFFFFNN
% 0.22/0.51 # partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.22/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.22/0.51 # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 2255 completed with status 0
% 0.22/0.51 # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 0.22/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.51 # Search class: FGUSM-FFMM32-MFFFFFNN
% 0.22/0.51 # partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.22/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.22/0.51 # Preprocessing time : 0.001 s
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Theorem
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 85
% 0.22/0.51 # Removed by relevancy pruning/SinE : 28
% 0.22/0.51 # Initial clauses : 61
% 0.22/0.51 # Removed in clause preprocessing : 0
% 0.22/0.51 # Initial clauses in saturation : 61
% 0.22/0.51 # Processed clauses : 129
% 0.22/0.51 # ...of these trivial : 0
% 0.22/0.51 # ...subsumed : 14
% 0.22/0.51 # ...remaining for further processing : 115
% 0.22/0.51 # Other redundant clauses eliminated : 0
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 0
% 0.22/0.51 # Backward-rewritten : 0
% 0.22/0.51 # Generated clauses : 229
% 0.22/0.51 # ...of the previous two non-redundant : 181
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 0
% 0.22/0.51 # Paramodulations : 227
% 0.22/0.51 # Factorizations : 2
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 0
% 0.22/0.51 # Disequality decompositions : 0
% 0.22/0.51 # Total rewrite steps : 118
% 0.22/0.51 # ...of those cached : 97
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 115
% 0.22/0.51 # Positive orientable unit clauses : 64
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 30
% 0.22/0.51 # Non-unit-clauses : 21
% 0.22/0.51 # Current number of unprocessed clauses: 113
% 0.22/0.51 # ...number of literals in the above : 255
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 0
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 28
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 4
% 0.22/0.51 # Non-unit clause-clause subsumptions : 0
% 0.22/0.51 # Unit Clause-clause subsumption calls : 354
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 4
% 0.22/0.51 # BW rewrite match successes : 0
% 0.22/0.51 # Condensation attempts : 0
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 5386
% 0.22/0.51 # Search garbage collected termcells : 590
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.005 s
% 0.22/0.51 # System time : 0.004 s
% 0.22/0.51 # Total time : 0.009 s
% 0.22/0.51 # Maximum resident set size: 1908 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.007 s
% 0.22/0.51 # System time : 0.005 s
% 0.22/0.51 # Total time : 0.012 s
% 0.22/0.51 # Maximum resident set size: 1796 pages
% 0.22/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------