TSTP Solution File: NUM183-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM183-1 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 : Tue May 21 01:06:10 EDT 2024
% Result : Unsatisfiable 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 14 unt; 5 nHn; 20 RR)
% Number of literals : 49 ( 2 equ; 23 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 31 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(prove_ordinals_are_kind_1_or_limit_1,negated_conjecture,
member(x,ordinal_numbers),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ordinals_are_kind_1_or_limit_1) ).
cnf(prove_ordinals_are_kind_1_or_limit_3,negated_conjecture,
~ member(x,limit_ordinals),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ordinals_are_kind_1_or_limit_3) ).
cnf(prove_ordinals_are_kind_1_or_limit_2,negated_conjecture,
~ member(x,kind_1_ordinals),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ordinals_are_kind_1_or_limit_2) ).
cnf(limit_ordinals,axiom,
intersection(complement(kind_1_ordinals),ordinal_numbers) = limit_ordinals,
file('/export/starexec/sandbox2/benchmark/Axioms/NUM004-0.ax',limit_ordinals) ).
cnf(c_0_8,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_9,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
c_0_8 ).
cnf(c_0_10,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_11,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_12,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_13,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
member(x,ordinal_numbers),
prove_ordinals_are_kind_1_or_limit_1 ).
cnf(c_0_15,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
c_0_11 ).
cnf(c_0_16,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
c_0_12 ).
cnf(c_0_17,negated_conjecture,
member(x,universal_class),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( member(x,intersection(X1,ordinal_numbers))
| ~ member(x,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( member(x,complement(X1))
| member(x,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
~ member(x,limit_ordinals),
inference(fof_simplification,[status(thm)],[prove_ordinals_are_kind_1_or_limit_3]) ).
cnf(c_0_21,negated_conjecture,
~ member(x,kind_1_ordinals),
inference(fof_simplification,[status(thm)],[prove_ordinals_are_kind_1_or_limit_2]) ).
cnf(c_0_22,negated_conjecture,
( member(x,intersection(complement(X1),ordinal_numbers))
| member(x,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,axiom,
intersection(complement(kind_1_ordinals),ordinal_numbers) = limit_ordinals,
limit_ordinals ).
cnf(c_0_24,negated_conjecture,
~ member(x,limit_ordinals),
c_0_20 ).
cnf(c_0_25,negated_conjecture,
~ member(x,kind_1_ordinals),
c_0_21 ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM183-1 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.12/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n004.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 : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 03:50:23 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.19/0.49 # Version: 3.1.0
% 0.19/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # new_bool_3 with pid 19600 completed with status 0
% 0.19/0.49 # Result found by new_bool_3
% 0.19/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.19/0.49 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.19/0.49 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 19603 completed with status 0
% 0.19/0.49 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 0.19/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.19/0.49 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.19/0.49 # Preprocessing time : 0.002 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Unsatisfiable
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 161
% 0.19/0.49 # Removed by relevancy pruning/SinE : 108
% 0.19/0.49 # Initial clauses : 53
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 53
% 0.19/0.49 # Processed clauses : 172
% 0.19/0.49 # ...of these trivial : 1
% 0.19/0.49 # ...subsumed : 1
% 0.19/0.49 # ...remaining for further processing : 170
% 0.19/0.49 # Other redundant clauses eliminated : 2
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 0
% 0.19/0.49 # Backward-rewritten : 0
% 0.19/0.49 # Generated clauses : 399
% 0.19/0.49 # ...of the previous two non-redundant : 320
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 396
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 3
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 81
% 0.19/0.49 # ...of those cached : 56
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 116
% 0.19/0.49 # Positive orientable unit clauses : 47
% 0.19/0.49 # Positive unorientable unit clauses: 1
% 0.19/0.49 # Negative unit clauses : 2
% 0.19/0.49 # Non-unit-clauses : 66
% 0.19/0.49 # Current number of unprocessed clauses: 243
% 0.19/0.49 # ...number of literals in the above : 426
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 52
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 684
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 613
% 0.19/0.49 # Non-unit clause-clause subsumptions : 1
% 0.19/0.49 # Unit Clause-clause subsumption calls : 67
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 33
% 0.19/0.49 # BW rewrite match successes : 5
% 0.19/0.49 # Condensation attempts : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 7750
% 0.19/0.49 # Search garbage collected termcells : 596
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.012 s
% 0.19/0.49 # System time : 0.006 s
% 0.19/0.49 # Total time : 0.018 s
% 0.19/0.49 # Maximum resident set size: 2016 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.016 s
% 0.19/0.49 # System time : 0.008 s
% 0.19/0.49 # Total time : 0.025 s
% 0.19/0.49 # Maximum resident set size: 1840 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------