TSTP Solution File: NUM066-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM066-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 18:45:52 EDT 2023
% Result : Unsatisfiable 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 34 ( 15 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 90 ( 49 ~; 39 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 49 ( 6 sgn; 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.JaCtFCLPoX/E---3.1_7394.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/tmp/tmp.JaCtFCLPoX/E---3.1_7394.p',class_elements_are_sets) ).
cnf(well_ordering3,axiom,
( member(least(X1,X3),X3)
| ~ well_ordering(X1,X2)
| ~ subclass(X3,X2)
| ~ member(X4,X3) ),
file('/export/starexec/sandbox/tmp/tmp.JaCtFCLPoX/E---3.1_7394.p',well_ordering3) ).
cnf(prove_corollary_to_well_ordering_property1_1,negated_conjecture,
well_ordering(element_relation,y),
file('/export/starexec/sandbox/tmp/tmp.JaCtFCLPoX/E---3.1_7394.p',prove_corollary_to_well_ordering_property1_1) ).
cnf(element_relation3,axiom,
( member(ordered_pair(X1,X2),element_relation)
| ~ member(ordered_pair(X1,X2),cross_product(universal_class,universal_class))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.JaCtFCLPoX/E---3.1_7394.p',element_relation3) ).
cnf(cartesian_product3,axiom,
( member(ordered_pair(X1,X3),cross_product(X2,X4))
| ~ member(X1,X2)
| ~ member(X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.JaCtFCLPoX/E---3.1_7394.p',cartesian_product3) ).
cnf(prove_corollary_to_well_ordering_property1_3,negated_conjecture,
member(v,u),
file('/export/starexec/sandbox/tmp/tmp.JaCtFCLPoX/E---3.1_7394.p',prove_corollary_to_well_ordering_property1_3) ).
cnf(prove_corollary_to_well_ordering_property1_2,negated_conjecture,
subclass(u,y),
file('/export/starexec/sandbox/tmp/tmp.JaCtFCLPoX/E---3.1_7394.p',prove_corollary_to_well_ordering_property1_2) ).
cnf(well_ordering5,axiom,
( ~ well_ordering(X1,X2)
| ~ subclass(X3,X2)
| ~ member(X4,X3)
| ~ member(ordered_pair(X4,least(X1,X3)),X1) ),
file('/export/starexec/sandbox/tmp/tmp.JaCtFCLPoX/E---3.1_7394.p',well_ordering5) ).
cnf(prove_corollary_to_well_ordering_property1_4,negated_conjecture,
member(v,least(element_relation,u)),
file('/export/starexec/sandbox/tmp/tmp.JaCtFCLPoX/E---3.1_7394.p',prove_corollary_to_well_ordering_property1_4) ).
cnf(c_0_10,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_11,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_12,axiom,
( member(least(X1,X3),X3)
| ~ well_ordering(X1,X2)
| ~ subclass(X3,X2)
| ~ member(X4,X3) ),
well_ordering3 ).
cnf(c_0_13,negated_conjecture,
well_ordering(element_relation,y),
prove_corollary_to_well_ordering_property1_1 ).
cnf(c_0_14,axiom,
( member(ordered_pair(X1,X2),element_relation)
| ~ member(ordered_pair(X1,X2),cross_product(universal_class,universal_class))
| ~ member(X1,X2) ),
element_relation3 ).
cnf(c_0_15,axiom,
( member(ordered_pair(X1,X3),cross_product(X2,X4))
| ~ member(X1,X2)
| ~ member(X3,X4) ),
cartesian_product3 ).
cnf(c_0_16,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( member(least(element_relation,X1),X1)
| ~ member(X2,X1)
| ~ subclass(X1,y) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
member(v,u),
prove_corollary_to_well_ordering_property1_3 ).
cnf(c_0_19,negated_conjecture,
subclass(u,y),
prove_corollary_to_well_ordering_property1_2 ).
cnf(c_0_20,axiom,
( ~ well_ordering(X1,X2)
| ~ subclass(X3,X2)
| ~ member(X4,X3)
| ~ member(ordered_pair(X4,least(X1,X3)),X1) ),
well_ordering5 ).
cnf(c_0_21,plain,
( member(ordered_pair(X1,X2),element_relation)
| ~ member(X2,universal_class)
| ~ member(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_22,negated_conjecture,
member(least(element_relation,u),u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
fof(c_0_23,plain,
( ~ epred1_0
<=> ! [X1] :
( ~ subclass(u,X1)
| ~ well_ordering(element_relation,X1) ) ),
introduced(definition) ).
fof(c_0_24,plain,
( ~ epred2_0
<=> ! [X2] :
( ~ member(X2,u)
| ~ member(X2,least(element_relation,u)) ) ),
introduced(definition) ).
cnf(c_0_25,plain,
( ~ well_ordering(element_relation,X1)
| ~ member(least(element_relation,X2),universal_class)
| ~ member(X3,least(element_relation,X2))
| ~ member(X3,X2)
| ~ subclass(X2,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
member(least(element_relation,u),universal_class),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( epred1_0
| ~ well_ordering(element_relation,X1)
| ~ subclass(u,X1) ),
inference(split_equiv,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_23]),c_0_24]) ).
cnf(c_0_29,negated_conjecture,
epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_13]),c_0_19])]) ).
cnf(c_0_30,negated_conjecture,
~ epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_31,negated_conjecture,
( ~ member(X1,least(element_relation,u))
| ~ member(X1,u) ),
inference(sr,[status(thm)],[inference(split_equiv,[status(thm)],[c_0_24]),c_0_30]) ).
cnf(c_0_32,negated_conjecture,
member(v,least(element_relation,u)),
prove_corollary_to_well_ordering_property1_4 ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUM066-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n018.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 14:23:38 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.JaCtFCLPoX/E---3.1_7394.p
% 0.21/0.53 # Version: 3.1pre001
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # new_bool_3 with pid 7503 completed with status 0
% 0.21/0.53 # Result found by new_bool_3
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FGHSM-FFMS31-MFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 130s (1) cores
% 0.21/0.53 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 7515 completed with status 0
% 0.21/0.53 # Result found by G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FGHSM-FFMS31-MFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 130s (1) cores
% 0.21/0.53 # Preprocessing time : 0.003 s
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Unsatisfiable
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 162
% 0.21/0.53 # Removed by relevancy pruning/SinE : 128
% 0.21/0.53 # Initial clauses : 34
% 0.21/0.53 # Removed in clause preprocessing : 0
% 0.21/0.53 # Initial clauses in saturation : 34
% 0.21/0.53 # Processed clauses : 151
% 0.21/0.53 # ...of these trivial : 10
% 0.21/0.53 # ...subsumed : 33
% 0.21/0.53 # ...remaining for further processing : 108
% 0.21/0.53 # Other redundant clauses eliminated : 2
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 6
% 0.21/0.53 # Backward-rewritten : 3
% 0.21/0.53 # Generated clauses : 558
% 0.21/0.53 # ...of the previous two non-redundant : 520
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 1
% 0.21/0.53 # Paramodulations : 553
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 2
% 0.21/0.53 # Total rewrite steps : 39
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 96
% 0.21/0.53 # Positive orientable unit clauses : 23
% 0.21/0.53 # Positive unorientable unit clauses: 1
% 0.21/0.53 # Negative unit clauses : 1
% 0.21/0.53 # Non-unit-clauses : 71
% 0.21/0.53 # Current number of unprocessed clauses: 396
% 0.21/0.53 # ...number of literals in the above : 1124
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 9
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 1018
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 795
% 0.21/0.53 # Non-unit clause-clause subsumptions : 40
% 0.21/0.53 # Unit Clause-clause subsumption calls : 75
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 14
% 0.21/0.53 # BW rewrite match successes : 2
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 9756
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.008 s
% 0.21/0.53 # System time : 0.009 s
% 0.21/0.53 # Total time : 0.017 s
% 0.21/0.53 # Maximum resident set size: 2000 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.010 s
% 0.21/0.53 # System time : 0.013 s
% 0.21/0.53 # Total time : 0.023 s
% 0.21/0.53 # Maximum resident set size: 1812 pages
% 0.21/0.53 % E---3.1 exiting
% 0.21/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------