TSTP Solution File: SET163-6 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET163-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:22:20 EDT 2023
% Result : Unsatisfiable 0.20s 0.55s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of clauses : 51 ( 21 unt; 11 nHn; 28 RR)
% Number of literals : 87 ( 26 equ; 37 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; 3 con; 0-3 aty)
% Number of variables : 79 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.rqhUGeC0Qg/E---3.1_14309.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.rqhUGeC0Qg/E---3.1_14309.p',class_elements_are_sets) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.rqhUGeC0Qg/E---3.1_14309.p',complement1) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.rqhUGeC0Qg/E---3.1_14309.p',not_subclass_members1) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.rqhUGeC0Qg/E---3.1_14309.p',regularity1) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.rqhUGeC0Qg/E---3.1_14309.p',intersection1) ).
cnf(domain1,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.rqhUGeC0Qg/E---3.1_14309.p',domain1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/tmp/tmp.rqhUGeC0Qg/E---3.1_14309.p',singleton_set) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox2/tmp/tmp.rqhUGeC0Qg/E---3.1_14309.p',restriction1) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.rqhUGeC0Qg/E---3.1_14309.p',subclass_implies_equal) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.rqhUGeC0Qg/E---3.1_14309.p',not_subclass_members2) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.rqhUGeC0Qg/E---3.1_14309.p',complement2) ).
cnf(prove_union_with_universal_class_1,negated_conjecture,
union(universal_class,x) != universal_class,
file('/export/starexec/sandbox2/tmp/tmp.rqhUGeC0Qg/E---3.1_14309.p',prove_union_with_universal_class_1) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.rqhUGeC0Qg/E---3.1_14309.p',union) ).
cnf(c_0_14,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_15,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_16,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_17,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_18,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_20,plain,
( subclass(complement(X1),X2)
| ~ member(not_subclass_element(complement(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( member(not_subclass_element(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_22,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_23,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
domain1 ).
cnf(c_0_24,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_25,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_26,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_27,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_29,plain,
subclass(complement(universal_class),X1),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_31,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_32,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_23,c_0_24]),c_0_25]) ).
cnf(c_0_33,plain,
null_class = complement(universal_class),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
( X1 = complement(universal_class)
| ~ subclass(X1,complement(universal_class)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
subclass(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( intersection(X1,cross_product(unordered_pair(X2,X2),universal_class)) != complement(universal_class)
| ~ member(X2,domain_of(X1)) ),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
intersection(complement(universal_class),X1) = complement(universal_class),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
~ member(X1,domain_of(complement(universal_class))),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,plain,
( X1 = complement(universal_class)
| member(regular(X1),X1) ),
inference(rw,[status(thm)],[c_0_19,c_0_33]) ).
cnf(c_0_40,plain,
domain_of(complement(universal_class)) = complement(universal_class),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_42,negated_conjecture,
union(universal_class,x) != universal_class,
prove_union_with_universal_class_1 ).
cnf(c_0_43,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_44,plain,
~ member(X1,complement(universal_class)),
inference(rw,[status(thm)],[c_0_38,c_0_40]) ).
cnf(c_0_45,plain,
( member(not_subclass_element(X1,complement(X2)),X2)
| subclass(X1,complement(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_41]),c_0_21]) ).
cnf(c_0_46,negated_conjecture,
complement(intersection(complement(universal_class),complement(x))) != universal_class,
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,plain,
( universal_class = X1
| ~ subclass(universal_class,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_15]) ).
cnf(c_0_48,plain,
subclass(X1,complement(complement(universal_class))),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
complement(complement(universal_class)) != universal_class,
inference(rw,[status(thm)],[c_0_46,c_0_37]) ).
cnf(c_0_50,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET163-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n025.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 : Mon Oct 2 17:53:06 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/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.rqhUGeC0Qg/E---3.1_14309.p
% 0.20/0.55 # Version: 3.1pre001
% 0.20/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.55 # Starting sh5l with 300s (1) cores
% 0.20/0.55 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 14392 completed with status 0
% 0.20/0.55 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.55 # No SInE strategy applied
% 0.20/0.55 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.20/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.20/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.55 # Starting new_bool_1 with 308s (1) cores
% 0.20/0.55 # Starting sh5l with 304s (1) cores
% 0.20/0.55 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.55 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 14401 completed with status 0
% 0.20/0.55 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.55 # No SInE strategy applied
% 0.20/0.55 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.20/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.20/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.55 # Preprocessing time : 0.003 s
% 0.20/0.55 # Presaturation interreduction done
% 0.20/0.55
% 0.20/0.55 # Proof found!
% 0.20/0.55 # SZS status Unsatisfiable
% 0.20/0.55 # SZS output start CNFRefutation
% See solution above
% 0.20/0.55 # Parsed axioms : 113
% 0.20/0.55 # Removed by relevancy pruning/SinE : 0
% 0.20/0.55 # Initial clauses : 113
% 0.20/0.55 # Removed in clause preprocessing : 17
% 0.20/0.55 # Initial clauses in saturation : 96
% 0.20/0.55 # Processed clauses : 469
% 0.20/0.55 # ...of these trivial : 0
% 0.20/0.55 # ...subsumed : 100
% 0.20/0.55 # ...remaining for further processing : 369
% 0.20/0.55 # Other redundant clauses eliminated : 6
% 0.20/0.55 # Clauses deleted for lack of memory : 0
% 0.20/0.55 # Backward-subsumed : 10
% 0.20/0.55 # Backward-rewritten : 18
% 0.20/0.55 # Generated clauses : 878
% 0.20/0.55 # ...of the previous two non-redundant : 775
% 0.20/0.55 # ...aggressively subsumed : 0
% 0.20/0.55 # Contextual simplify-reflections : 6
% 0.20/0.55 # Paramodulations : 870
% 0.20/0.55 # Factorizations : 2
% 0.20/0.55 # NegExts : 0
% 0.20/0.55 # Equation resolutions : 6
% 0.20/0.55 # Total rewrite steps : 154
% 0.20/0.55 # Propositional unsat checks : 0
% 0.20/0.55 # Propositional check models : 0
% 0.20/0.55 # Propositional check unsatisfiable : 0
% 0.20/0.55 # Propositional clauses : 0
% 0.20/0.55 # Propositional clauses after purity: 0
% 0.20/0.55 # Propositional unsat core size : 0
% 0.20/0.55 # Propositional preprocessing time : 0.000
% 0.20/0.55 # Propositional encoding time : 0.000
% 0.20/0.55 # Propositional solver time : 0.000
% 0.20/0.55 # Success case prop preproc time : 0.000
% 0.20/0.55 # Success case prop encoding time : 0.000
% 0.20/0.55 # Success case prop solver time : 0.000
% 0.20/0.55 # Current number of processed clauses : 242
% 0.20/0.55 # Positive orientable unit clauses : 38
% 0.20/0.55 # Positive unorientable unit clauses: 1
% 0.20/0.55 # Negative unit clauses : 3
% 0.20/0.55 # Non-unit-clauses : 200
% 0.20/0.55 # Current number of unprocessed clauses: 459
% 0.20/0.55 # ...number of literals in the above : 1310
% 0.20/0.55 # Current number of archived formulas : 0
% 0.20/0.55 # Current number of archived clauses : 140
% 0.20/0.55 # Clause-clause subsumption calls (NU) : 8242
% 0.20/0.55 # Rec. Clause-clause subsumption calls : 4667
% 0.20/0.55 # Non-unit clause-clause subsumptions : 90
% 0.20/0.55 # Unit Clause-clause subsumption calls : 293
% 0.20/0.55 # Rewrite failures with RHS unbound : 0
% 0.20/0.55 # BW rewrite match attempts : 21
% 0.20/0.55 # BW rewrite match successes : 10
% 0.20/0.55 # Condensation attempts : 0
% 0.20/0.55 # Condensation successes : 0
% 0.20/0.55 # Termbank termtop insertions : 28966
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.051 s
% 0.20/0.55 # System time : 0.004 s
% 0.20/0.55 # Total time : 0.055 s
% 0.20/0.55 # Maximum resident set size: 2000 pages
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.244 s
% 0.20/0.55 # System time : 0.013 s
% 0.20/0.55 # Total time : 0.257 s
% 0.20/0.55 # Maximum resident set size: 1772 pages
% 0.20/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------