TSTP Solution File: SET287-6 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET287-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:19:02 EDT 2023
% Result : Unsatisfiable 0.16s 0.51s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of clauses : 58 ( 22 unt; 11 nHn; 37 RR)
% Number of literals : 103 ( 29 equ; 44 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 97 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.XZduV88gDf/E---3.1_21637.p',subclass_members) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.XZduV88gDf/E---3.1_21637.p',not_subclass_members1) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/tmp.XZduV88gDf/E---3.1_21637.p',not_subclass_members2) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.XZduV88gDf/E---3.1_21637.p',intersection3) ).
cnf(prove_domain_property8_1,negated_conjecture,
subclass(x,y),
file('/export/starexec/sandbox/tmp/tmp.XZduV88gDf/E---3.1_21637.p',prove_domain_property8_1) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox/tmp/tmp.XZduV88gDf/E---3.1_21637.p',regularity1) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.XZduV88gDf/E---3.1_21637.p',intersection1) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.XZduV88gDf/E---3.1_21637.p',complement1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/tmp/tmp.XZduV88gDf/E---3.1_21637.p',class_elements_are_sets) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.XZduV88gDf/E---3.1_21637.p',subclass_implies_equal) ).
cnf(domain1,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.XZduV88gDf/E---3.1_21637.p',domain1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/tmp/tmp.XZduV88gDf/E---3.1_21637.p',singleton_set) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox/tmp/tmp.XZduV88gDf/E---3.1_21637.p',restriction1) ).
cnf(restriction2,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
file('/export/starexec/sandbox/tmp/tmp.XZduV88gDf/E---3.1_21637.p',restriction2) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.XZduV88gDf/E---3.1_21637.p',intersection2) ).
cnf(prove_domain_property8_2,negated_conjecture,
domain_of(intersection(complement(y),x)) != null_class,
file('/export/starexec/sandbox/tmp/tmp.XZduV88gDf/E---3.1_21637.p',prove_domain_property8_2) ).
cnf(c_0_16,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_17,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_18,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_19,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_20,plain,
( member(not_subclass_element(X1,X2),X3)
| subclass(X1,X2)
| ~ subclass(X1,X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
subclass(x,y),
prove_domain_property8_1 ).
cnf(c_0_22,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_23,plain,
( subclass(X1,intersection(X2,X3))
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X3)
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( member(not_subclass_element(x,X1),y)
| subclass(x,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_26,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_27,plain,
( X1 = null_class
| member(regular(X1),X2)
| ~ subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_28,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_29,negated_conjecture,
( subclass(x,intersection(X1,y))
| ~ member(not_subclass_element(x,intersection(X1,y)),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_25,c_0_17]) ).
cnf(c_0_31,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_22]) ).
cnf(c_0_32,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_34,negated_conjecture,
subclass(x,intersection(x,y)),
inference(spm,[status(thm)],[c_0_29,c_0_17]) ).
cnf(c_0_35,plain,
subclass(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_18,c_0_30]) ).
cnf(c_0_36,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
domain1 ).
cnf(c_0_37,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_38,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_39,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_40,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_41,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_42,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_22]) ).
cnf(c_0_43,negated_conjecture,
intersection(x,y) = x,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_44,plain,
( intersection(X1,cross_product(unordered_pair(X2,X2),universal_class)) != null_class
| ~ member(X2,domain_of(X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_45,plain,
intersection(cross_product(X1,X2),X3) = intersection(X3,cross_product(X1,X2)),
inference(rw,[status(thm)],[c_0_39,c_0_38]) ).
cnf(c_0_46,plain,
( ~ member(X1,null_class)
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_26,c_0_40]) ).
cnf(c_0_47,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_22]) ).
cnf(c_0_48,plain,
( intersection(complement(X1),X2) = null_class
| ~ member(regular(intersection(complement(X1),X2)),X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_42]) ).
cnf(c_0_49,negated_conjecture,
( member(X1,y)
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_41,c_0_43]) ).
cnf(c_0_50,plain,
( intersection(cross_product(unordered_pair(X1,X1),universal_class),X2) != null_class
| ~ member(X1,domain_of(X2)) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,plain,
intersection(X1,null_class) = null_class,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_32]) ).
cnf(c_0_52,negated_conjecture,
( intersection(complement(y),X1) = null_class
| ~ member(regular(intersection(complement(y),X1)),x) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,plain,
~ member(X1,domain_of(null_class)),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
domain_of(intersection(complement(y),x)) != null_class,
prove_domain_property8_2 ).
cnf(c_0_55,negated_conjecture,
intersection(complement(y),x) = null_class,
inference(spm,[status(thm)],[c_0_52,c_0_47]) ).
cnf(c_0_56,plain,
domain_of(null_class) = null_class,
inference(spm,[status(thm)],[c_0_53,c_0_22]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55]),c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET287-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n019.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 17:00:21 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.44 Running first-order theorem proving
% 0.16/0.44 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.XZduV88gDf/E---3.1_21637.p
% 0.16/0.51 # Version: 3.1pre001
% 0.16/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.51 # Starting sh5l with 300s (1) cores
% 0.16/0.51 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 21715 completed with status 0
% 0.16/0.51 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.51 # No SInE strategy applied
% 0.16/0.51 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.16/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.16/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.51 # Starting new_bool_1 with 308s (1) cores
% 0.16/0.51 # Starting sh5l with 304s (1) cores
% 0.16/0.51 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.51 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 21726 completed with status 0
% 0.16/0.51 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.51 # No SInE strategy applied
% 0.16/0.51 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.16/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.16/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.51 # Starting new_bool_1 with 308s (1) cores
% 0.16/0.51 # Starting sh5l with 304s (1) cores
% 0.16/0.51 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.51 # Preprocessing time : 0.003 s
% 0.16/0.51 # Presaturation interreduction done
% 0.16/0.51
% 0.16/0.51 # Proof found!
% 0.16/0.51 # SZS status Unsatisfiable
% 0.16/0.51 # SZS output start CNFRefutation
% See solution above
% 0.16/0.51 # Parsed axioms : 114
% 0.16/0.51 # Removed by relevancy pruning/SinE : 0
% 0.16/0.51 # Initial clauses : 114
% 0.16/0.51 # Removed in clause preprocessing : 17
% 0.16/0.51 # Initial clauses in saturation : 97
% 0.16/0.51 # Processed clauses : 751
% 0.16/0.51 # ...of these trivial : 4
% 0.16/0.51 # ...subsumed : 236
% 0.16/0.51 # ...remaining for further processing : 511
% 0.16/0.51 # Other redundant clauses eliminated : 8
% 0.16/0.51 # Clauses deleted for lack of memory : 0
% 0.16/0.51 # Backward-subsumed : 48
% 0.16/0.51 # Backward-rewritten : 14
% 0.16/0.51 # Generated clauses : 1491
% 0.16/0.51 # ...of the previous two non-redundant : 1234
% 0.16/0.51 # ...aggressively subsumed : 0
% 0.16/0.51 # Contextual simplify-reflections : 7
% 0.16/0.51 # Paramodulations : 1475
% 0.16/0.51 # Factorizations : 8
% 0.16/0.51 # NegExts : 0
% 0.16/0.51 # Equation resolutions : 8
% 0.16/0.51 # Total rewrite steps : 417
% 0.16/0.51 # Propositional unsat checks : 0
% 0.16/0.51 # Propositional check models : 0
% 0.16/0.51 # Propositional check unsatisfiable : 0
% 0.16/0.51 # Propositional clauses : 0
% 0.16/0.51 # Propositional clauses after purity: 0
% 0.16/0.51 # Propositional unsat core size : 0
% 0.16/0.51 # Propositional preprocessing time : 0.000
% 0.16/0.51 # Propositional encoding time : 0.000
% 0.16/0.51 # Propositional solver time : 0.000
% 0.16/0.51 # Success case prop preproc time : 0.000
% 0.16/0.51 # Success case prop encoding time : 0.000
% 0.16/0.51 # Success case prop solver time : 0.000
% 0.16/0.51 # Current number of processed clauses : 349
% 0.16/0.51 # Positive orientable unit clauses : 57
% 0.16/0.51 # Positive unorientable unit clauses: 1
% 0.16/0.51 # Negative unit clauses : 2
% 0.16/0.51 # Non-unit-clauses : 289
% 0.16/0.51 # Current number of unprocessed clauses: 612
% 0.16/0.51 # ...number of literals in the above : 1732
% 0.16/0.51 # Current number of archived formulas : 0
% 0.16/0.51 # Current number of archived clauses : 175
% 0.16/0.51 # Clause-clause subsumption calls (NU) : 18510
% 0.16/0.51 # Rec. Clause-clause subsumption calls : 9696
% 0.16/0.51 # Non-unit clause-clause subsumptions : 230
% 0.16/0.51 # Unit Clause-clause subsumption calls : 1125
% 0.16/0.51 # Rewrite failures with RHS unbound : 0
% 0.16/0.51 # BW rewrite match attempts : 39
% 0.16/0.51 # BW rewrite match successes : 12
% 0.16/0.51 # Condensation attempts : 0
% 0.16/0.51 # Condensation successes : 0
% 0.16/0.51 # Termbank termtop insertions : 39400
% 0.16/0.51
% 0.16/0.51 # -------------------------------------------------
% 0.16/0.51 # User time : 0.061 s
% 0.16/0.51 # System time : 0.005 s
% 0.16/0.51 # Total time : 0.066 s
% 0.16/0.51 # Maximum resident set size: 2040 pages
% 0.16/0.51
% 0.16/0.51 # -------------------------------------------------
% 0.16/0.51 # User time : 0.305 s
% 0.16/0.51 # System time : 0.013 s
% 0.16/0.51 # Total time : 0.318 s
% 0.16/0.51 # Maximum resident set size: 1772 pages
% 0.16/0.51 % E---3.1 exiting
% 0.16/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------