TSTP Solution File: SET195-6 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET195-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:18:50 EDT 2023
% Result : Unsatisfiable 4.81s 1.08s
% Output : CNFRefutation 4.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of clauses : 46 ( 15 unt; 10 nHn; 26 RR)
% Number of literals : 86 ( 7 equ; 36 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 89 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.NvgxswkvtS/E---3.1_11286.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/tmp/tmp.NvgxswkvtS/E---3.1_11286.p',class_elements_are_sets) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.NvgxswkvtS/E---3.1_11286.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.NvgxswkvtS/E---3.1_11286.p',not_subclass_members2) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.NvgxswkvtS/E---3.1_11286.p',complement2) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.NvgxswkvtS/E---3.1_11286.p',complement1) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.NvgxswkvtS/E---3.1_11286.p',intersection3) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.NvgxswkvtS/E---3.1_11286.p',intersection1) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.NvgxswkvtS/E---3.1_11286.p',intersection2) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.NvgxswkvtS/E---3.1_11286.p',subclass_implies_equal) ).
cnf(prove_lattice_upper_bound2_1,negated_conjecture,
~ subclass(y,union(x,y)),
file('/export/starexec/sandbox/tmp/tmp.NvgxswkvtS/E---3.1_11286.p',prove_lattice_upper_bound2_1) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.NvgxswkvtS/E---3.1_11286.p',union) ).
cnf(c_0_12,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_13,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_14,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_16,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_17,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_18,plain,
( member(not_subclass_element(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_20,plain,
( member(not_subclass_element(X1,complement(X2)),X2)
| subclass(X1,complement(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_21,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_22,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_23,plain,
( subclass(X1,complement(complement(X2)))
| ~ member(not_subclass_element(X1,complement(complement(X2))),X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( subclass(complement(X1),X2)
| ~ member(not_subclass_element(complement(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_25,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_16,c_0_21]) ).
cnf(c_0_26,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_15]) ).
cnf(c_0_27,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_28,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_29,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_23,c_0_15]) ).
cnf(c_0_30,plain,
( member(not_subclass_element(complement(complement(X1)),X2),X1)
| subclass(complement(complement(X1)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_17]),c_0_18]) ).
cnf(c_0_31,plain,
( subclass(intersection(X1,X2),intersection(X3,X1))
| ~ member(not_subclass_element(intersection(X1,X2),intersection(X3,X1)),X3) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X2)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_27,c_0_15]) ).
cnf(c_0_33,plain,
( complement(complement(X1)) = X1
| ~ subclass(complement(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_16,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
~ subclass(y,union(x,y)),
prove_lattice_upper_bound2_1 ).
cnf(c_0_36,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_37,plain,
subclass(intersection(X1,X2),intersection(X2,X1)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_39,negated_conjecture,
~ subclass(y,complement(intersection(complement(x),complement(y)))),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_37]),c_0_37])]) ).
cnf(c_0_41,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),complement(X1)) ),
inference(spm,[status(thm)],[c_0_24,c_0_38]) ).
cnf(c_0_42,plain,
( member(not_subclass_element(X1,complement(intersection(X2,X3))),X2)
| subclass(X1,complement(intersection(X2,X3))) ),
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_43,negated_conjecture,
~ subclass(y,complement(intersection(complement(y),complement(x)))),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
subclass(X1,complement(intersection(complement(X1),X2))),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET195-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n022.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:02:54 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.NvgxswkvtS/E---3.1_11286.p
% 4.81/1.08 # Version: 3.1pre001
% 4.81/1.08 # Preprocessing class: FSLSSMSMSSSNFFN.
% 4.81/1.08 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.81/1.08 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.81/1.08 # Starting new_bool_3 with 300s (1) cores
% 4.81/1.08 # Starting new_bool_1 with 300s (1) cores
% 4.81/1.08 # Starting sh5l with 300s (1) cores
% 4.81/1.08 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 11364 completed with status 0
% 4.81/1.08 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 4.81/1.08 # Preprocessing class: FSLSSMSMSSSNFFN.
% 4.81/1.08 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.81/1.08 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.81/1.08 # No SInE strategy applied
% 4.81/1.08 # Search class: FGHSM-FFLM31-DFFFFFNN
% 4.81/1.08 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 4.81/1.08 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 4.81/1.08 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.81/1.08 # Starting new_bool_1 with 308s (1) cores
% 4.81/1.08 # Starting sh5l with 304s (1) cores
% 4.81/1.08 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 4.81/1.08 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 11372 completed with status 0
% 4.81/1.08 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 4.81/1.08 # Preprocessing class: FSLSSMSMSSSNFFN.
% 4.81/1.08 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.81/1.08 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.81/1.08 # No SInE strategy applied
% 4.81/1.08 # Search class: FGHSM-FFLM31-DFFFFFNN
% 4.81/1.08 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 4.81/1.08 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 4.81/1.08 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.81/1.08 # Preprocessing time : 0.004 s
% 4.81/1.08 # Presaturation interreduction done
% 4.81/1.08
% 4.81/1.08 # Proof found!
% 4.81/1.08 # SZS status Unsatisfiable
% 4.81/1.08 # SZS output start CNFRefutation
% See solution above
% 4.81/1.08 # Parsed axioms : 113
% 4.81/1.08 # Removed by relevancy pruning/SinE : 0
% 4.81/1.08 # Initial clauses : 113
% 4.81/1.08 # Removed in clause preprocessing : 17
% 4.81/1.08 # Initial clauses in saturation : 96
% 4.81/1.08 # Processed clauses : 5254
% 4.81/1.08 # ...of these trivial : 118
% 4.81/1.08 # ...subsumed : 3630
% 4.81/1.08 # ...remaining for further processing : 1506
% 4.81/1.08 # Other redundant clauses eliminated : 18
% 4.81/1.08 # Clauses deleted for lack of memory : 0
% 4.81/1.08 # Backward-subsumed : 88
% 4.81/1.08 # Backward-rewritten : 387
% 4.81/1.08 # Generated clauses : 24238
% 4.81/1.08 # ...of the previous two non-redundant : 19734
% 4.81/1.08 # ...aggressively subsumed : 0
% 4.81/1.08 # Contextual simplify-reflections : 20
% 4.81/1.08 # Paramodulations : 24206
% 4.81/1.08 # Factorizations : 14
% 4.81/1.08 # NegExts : 0
% 4.81/1.08 # Equation resolutions : 18
% 4.81/1.08 # Total rewrite steps : 10507
% 4.81/1.08 # Propositional unsat checks : 0
% 4.81/1.08 # Propositional check models : 0
% 4.81/1.08 # Propositional check unsatisfiable : 0
% 4.81/1.08 # Propositional clauses : 0
% 4.81/1.08 # Propositional clauses after purity: 0
% 4.81/1.08 # Propositional unsat core size : 0
% 4.81/1.08 # Propositional preprocessing time : 0.000
% 4.81/1.08 # Propositional encoding time : 0.000
% 4.81/1.08 # Propositional solver time : 0.000
% 4.81/1.08 # Success case prop preproc time : 0.000
% 4.81/1.08 # Success case prop encoding time : 0.000
% 4.81/1.08 # Success case prop solver time : 0.000
% 4.81/1.08 # Current number of processed clauses : 932
% 4.81/1.08 # Positive orientable unit clauses : 162
% 4.81/1.08 # Positive unorientable unit clauses: 1
% 4.81/1.08 # Negative unit clauses : 11
% 4.81/1.08 # Non-unit-clauses : 758
% 4.81/1.08 # Current number of unprocessed clauses: 14265
% 4.81/1.08 # ...number of literals in the above : 44129
% 4.81/1.08 # Current number of archived formulas : 0
% 4.81/1.08 # Current number of archived clauses : 587
% 4.81/1.08 # Clause-clause subsumption calls (NU) : 135598
% 4.81/1.08 # Rec. Clause-clause subsumption calls : 79544
% 4.81/1.08 # Non-unit clause-clause subsumptions : 3001
% 4.81/1.08 # Unit Clause-clause subsumption calls : 7549
% 4.81/1.08 # Rewrite failures with RHS unbound : 0
% 4.81/1.08 # BW rewrite match attempts : 706
% 4.81/1.08 # BW rewrite match successes : 470
% 4.81/1.08 # Condensation attempts : 0
% 4.81/1.08 # Condensation successes : 0
% 4.81/1.08 # Termbank termtop insertions : 752390
% 4.81/1.08
% 4.81/1.08 # -------------------------------------------------
% 4.81/1.08 # User time : 0.600 s
% 4.81/1.08 # System time : 0.023 s
% 4.81/1.08 # Total time : 0.623 s
% 4.81/1.08 # Maximum resident set size: 2000 pages
% 4.81/1.08
% 4.81/1.08 # -------------------------------------------------
% 4.81/1.08 # User time : 3.042 s
% 4.81/1.08 # System time : 0.068 s
% 4.81/1.08 # Total time : 3.110 s
% 4.81/1.08 # Maximum resident set size: 1768 pages
% 4.81/1.08 % E---3.1 exiting
% 4.81/1.08 % E---3.1 exiting
%------------------------------------------------------------------------------