TSTP Solution File: SET002-6 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET002-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 02:56:47 EDT 2024
% Result : Unsatisfiable 1.50s 0.72s
% Output : CNFRefutation 1.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 49 ( 16 unt; 9 nHn; 30 RR)
% Number of literals : 95 ( 13 equ; 45 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 89 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(prove_idempotency_of_union_1,negated_conjecture,
union(x,x) != x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_idempotency_of_union_1) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',union) ).
cnf(c_0_11,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_12,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
c_0_11 ).
cnf(c_0_13,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_14,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_15,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_16,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_17,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_19,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
c_0_14 ).
cnf(c_0_20,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
c_0_15 ).
cnf(c_0_21,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_22,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_23,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
c_0_16 ).
cnf(c_0_24,plain,
( member(not_subclass_element(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
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_19,c_0_20]) ).
cnf(c_0_26,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
c_0_21 ).
cnf(c_0_27,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
c_0_22 ).
cnf(c_0_28,plain,
( member(not_subclass_element(X1,complement(X2)),X2)
| subclass(X1,complement(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_23]),c_0_24]) ).
cnf(c_0_29,negated_conjecture,
union(x,x) != x,
inference(fof_simplification,[status(thm)],[prove_idempotency_of_union_1]) ).
cnf(c_0_30,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_31,plain,
( subclass(X1,intersection(X2,X1))
| ~ member(not_subclass_element(X1,intersection(X2,X1)),X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_32,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_26,c_0_18]) ).
cnf(c_0_33,plain,
( subclass(X1,complement(complement(X2)))
| ~ member(not_subclass_element(X1,complement(complement(X2))),X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( subclass(complement(X1),X2)
| ~ member(not_subclass_element(complement(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_18]) ).
cnf(c_0_35,negated_conjecture,
union(x,x) != x,
c_0_29 ).
cnf(c_0_36,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_37,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
c_0_30 ).
cnf(c_0_38,plain,
subclass(X1,intersection(X1,X1)),
inference(spm,[status(thm)],[c_0_31,c_0_18]) ).
cnf(c_0_39,plain,
subclass(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_19,c_0_32]) ).
cnf(c_0_40,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_33,c_0_18]) ).
cnf(c_0_41,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_34,c_0_23]),c_0_24]) ).
cnf(c_0_42,negated_conjecture,
complement(intersection(complement(x),complement(x))) != x,
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,plain,
intersection(X1,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_44,plain,
( complement(complement(X1)) = X1
| ~ subclass(complement(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_40]) ).
cnf(c_0_45,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_19,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
complement(complement(x)) != x,
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET002-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n011.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 : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 12:55:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order model finding
% 0.19/0.46 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 1.50/0.72 # Version: 3.1.0
% 1.50/0.72 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.50/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.50/0.72 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.50/0.72 # Starting new_bool_3 with 300s (1) cores
% 1.50/0.72 # Starting new_bool_1 with 300s (1) cores
% 1.50/0.72 # Starting sh5l with 300s (1) cores
% 1.50/0.72 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4703 completed with status 0
% 1.50/0.72 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.50/0.72 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.50/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.50/0.72 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.50/0.72 # No SInE strategy applied
% 1.50/0.72 # Search class: FGHSM-FFLM31-DFFFFFNN
% 1.50/0.72 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.50/0.72 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 1.50/0.72 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.50/0.72 # Starting new_bool_1 with 308s (1) cores
% 1.50/0.72 # Starting sh5l with 304s (1) cores
% 1.50/0.72 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.50/0.72 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4711 completed with status 0
% 1.50/0.72 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.50/0.72 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.50/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.50/0.72 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.50/0.72 # No SInE strategy applied
% 1.50/0.72 # Search class: FGHSM-FFLM31-DFFFFFNN
% 1.50/0.72 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.50/0.72 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 1.50/0.72 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.50/0.72 # Preprocessing time : 0.003 s
% 1.50/0.72 # Presaturation interreduction done
% 1.50/0.72
% 1.50/0.72 # Proof found!
% 1.50/0.72 # SZS status Unsatisfiable
% 1.50/0.72 # SZS output start CNFRefutation
% See solution above
% 1.50/0.72 # Parsed axioms : 113
% 1.50/0.72 # Removed by relevancy pruning/SinE : 0
% 1.50/0.72 # Initial clauses : 113
% 1.50/0.72 # Removed in clause preprocessing : 17
% 1.50/0.72 # Initial clauses in saturation : 96
% 1.50/0.72 # Processed clauses : 2596
% 1.50/0.72 # ...of these trivial : 48
% 1.50/0.72 # ...subsumed : 1601
% 1.50/0.72 # ...remaining for further processing : 947
% 1.50/0.72 # Other redundant clauses eliminated : 14
% 1.50/0.72 # Clauses deleted for lack of memory : 0
% 1.50/0.72 # Backward-subsumed : 29
% 1.50/0.72 # Backward-rewritten : 366
% 1.50/0.72 # Generated clauses : 8503
% 1.50/0.72 # ...of the previous two non-redundant : 7806
% 1.50/0.72 # ...aggressively subsumed : 0
% 1.50/0.72 # Contextual simplify-reflections : 14
% 1.50/0.72 # Paramodulations : 8479
% 1.50/0.72 # Factorizations : 10
% 1.50/0.72 # NegExts : 0
% 1.50/0.72 # Equation resolutions : 14
% 1.50/0.72 # Disequality decompositions : 0
% 1.50/0.72 # Total rewrite steps : 3663
% 1.50/0.72 # ...of those cached : 3212
% 1.50/0.72 # Propositional unsat checks : 0
% 1.50/0.72 # Propositional check models : 0
% 1.50/0.72 # Propositional check unsatisfiable : 0
% 1.50/0.72 # Propositional clauses : 0
% 1.50/0.72 # Propositional clauses after purity: 0
% 1.50/0.72 # Propositional unsat core size : 0
% 1.50/0.72 # Propositional preprocessing time : 0.000
% 1.50/0.72 # Propositional encoding time : 0.000
% 1.50/0.72 # Propositional solver time : 0.000
% 1.50/0.72 # Success case prop preproc time : 0.000
% 1.50/0.72 # Success case prop encoding time : 0.000
% 1.50/0.72 # Success case prop solver time : 0.000
% 1.50/0.72 # Current number of processed clauses : 453
% 1.50/0.72 # Positive orientable unit clauses : 72
% 1.50/0.72 # Positive unorientable unit clauses: 1
% 1.50/0.72 # Negative unit clauses : 11
% 1.50/0.72 # Non-unit-clauses : 369
% 1.50/0.72 # Current number of unprocessed clauses: 5114
% 1.50/0.72 # ...number of literals in the above : 17079
% 1.50/0.72 # Current number of archived formulas : 0
% 1.50/0.72 # Current number of archived clauses : 507
% 1.50/0.72 # Clause-clause subsumption calls (NU) : 63598
% 1.50/0.72 # Rec. Clause-clause subsumption calls : 37534
% 1.50/0.72 # Non-unit clause-clause subsumptions : 1235
% 1.50/0.72 # Unit Clause-clause subsumption calls : 3074
% 1.50/0.72 # Rewrite failures with RHS unbound : 0
% 1.50/0.72 # BW rewrite match attempts : 233
% 1.50/0.72 # BW rewrite match successes : 132
% 1.50/0.72 # Condensation attempts : 0
% 1.50/0.72 # Condensation successes : 0
% 1.50/0.72 # Termbank termtop insertions : 412205
% 1.50/0.72 # Search garbage collected termcells : 185
% 1.50/0.72
% 1.50/0.72 # -------------------------------------------------
% 1.50/0.72 # User time : 0.231 s
% 1.50/0.72 # System time : 0.011 s
% 1.50/0.72 # Total time : 0.242 s
% 1.50/0.72 # Maximum resident set size: 2000 pages
% 1.50/0.72
% 1.50/0.72 # -------------------------------------------------
% 1.50/0.72 # User time : 1.156 s
% 1.50/0.72 # System time : 0.027 s
% 1.50/0.72 # Total time : 1.184 s
% 1.50/0.72 # Maximum resident set size: 1792 pages
% 1.50/0.72 % E---3.1 exiting
%------------------------------------------------------------------------------