TSTP Solution File: SET156-6 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET156-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 : Sat May 4 09:22:25 EDT 2024
% Result : Unsatisfiable 2.48s 0.73s
% Output : CNFRefutation 2.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of clauses : 36 ( 12 unt; 8 nHn; 21 RR)
% Number of literals : 69 ( 11 equ; 32 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 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 : 59 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4NVDpHYtfd/E---3.1_24181.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.4NVDpHYtfd/E---3.1_24181.p',class_elements_are_sets) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4NVDpHYtfd/E---3.1_24181.p',not_subclass_members2) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.4NVDpHYtfd/E---3.1_24181.p',complement2) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4NVDpHYtfd/E---3.1_24181.p',not_subclass_members1) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4NVDpHYtfd/E---3.1_24181.p',complement1) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4NVDpHYtfd/E---3.1_24181.p',subclass_implies_equal) ).
cnf(prove_demorgans_law2_1,negated_conjecture,
complement(intersection(x,y)) != union(complement(x),complement(y)),
file('/export/starexec/sandbox2/tmp/tmp.4NVDpHYtfd/E---3.1_24181.p',prove_demorgans_law2_1) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.4NVDpHYtfd/E---3.1_24181.p',union) ).
cnf(c_0_9,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_10,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
c_0_9 ).
cnf(c_0_11,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_12,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_13,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_14,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_16,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_17,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
c_0_12 ).
cnf(c_0_18,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
c_0_13 ).
cnf(c_0_19,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_20,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
c_0_16 ).
cnf(c_0_21,plain,
( member(not_subclass_element(X1,complement(X2)),X2)
| subclass(X1,complement(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_22,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
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_20,c_0_21]) ).
cnf(c_0_24,plain,
( subclass(complement(X1),X2)
| ~ member(not_subclass_element(complement(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_25,negated_conjecture,
complement(intersection(x,y)) != union(complement(x),complement(y)),
inference(fof_simplification,[status(thm)],[prove_demorgans_law2_1]) ).
cnf(c_0_26,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
c_0_22 ).
cnf(c_0_27,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_23,c_0_15]) ).
cnf(c_0_28,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_18]),c_0_19]) ).
cnf(c_0_29,negated_conjecture,
complement(intersection(x,y)) != union(complement(x),complement(y)),
c_0_25 ).
cnf(c_0_30,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_31,plain,
( complement(complement(X1)) = X1
| ~ subclass(complement(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_17,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
complement(intersection(x,y)) != complement(intersection(complement(complement(x)),complement(complement(y)))),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SET156-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n005.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 10:23:55 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 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.4NVDpHYtfd/E---3.1_24181.p
% 2.48/0.73 # Version: 3.1.0
% 2.48/0.73 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.48/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.48/0.73 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.48/0.73 # Starting new_bool_3 with 300s (1) cores
% 2.48/0.73 # Starting new_bool_1 with 300s (1) cores
% 2.48/0.73 # Starting sh5l with 300s (1) cores
% 2.48/0.73 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 24258 completed with status 0
% 2.48/0.73 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.48/0.73 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.48/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.48/0.73 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.48/0.73 # No SInE strategy applied
% 2.48/0.73 # Search class: FGHSM-FFLM31-DFFFFFNN
% 2.48/0.73 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.48/0.73 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 2.48/0.73 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.48/0.73 # Starting new_bool_1 with 308s (1) cores
% 2.48/0.73 # Starting sh5l with 304s (1) cores
% 2.48/0.73 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.48/0.73 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 24266 completed with status 0
% 2.48/0.73 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.48/0.73 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.48/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.48/0.73 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.48/0.73 # No SInE strategy applied
% 2.48/0.73 # Search class: FGHSM-FFLM31-DFFFFFNN
% 2.48/0.73 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.48/0.73 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 2.48/0.73 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.48/0.73 # Preprocessing time : 0.003 s
% 2.48/0.73 # Presaturation interreduction done
% 2.48/0.73
% 2.48/0.73 # Proof found!
% 2.48/0.73 # SZS status Unsatisfiable
% 2.48/0.73 # SZS output start CNFRefutation
% See solution above
% 2.48/0.73 # Parsed axioms : 113
% 2.48/0.73 # Removed by relevancy pruning/SinE : 0
% 2.48/0.73 # Initial clauses : 113
% 2.48/0.73 # Removed in clause preprocessing : 17
% 2.48/0.73 # Initial clauses in saturation : 96
% 2.48/0.73 # Processed clauses : 2629
% 2.48/0.73 # ...of these trivial : 68
% 2.48/0.73 # ...subsumed : 1619
% 2.48/0.73 # ...remaining for further processing : 942
% 2.48/0.73 # Other redundant clauses eliminated : 14
% 2.48/0.73 # Clauses deleted for lack of memory : 0
% 2.48/0.73 # Backward-subsumed : 23
% 2.48/0.73 # Backward-rewritten : 362
% 2.48/0.73 # Generated clauses : 8714
% 2.48/0.73 # ...of the previous two non-redundant : 8006
% 2.48/0.73 # ...aggressively subsumed : 0
% 2.48/0.73 # Contextual simplify-reflections : 14
% 2.48/0.73 # Paramodulations : 8690
% 2.48/0.73 # Factorizations : 10
% 2.48/0.73 # NegExts : 0
% 2.48/0.73 # Equation resolutions : 14
% 2.48/0.73 # Disequality decompositions : 0
% 2.48/0.73 # Total rewrite steps : 3724
% 2.48/0.73 # ...of those cached : 3272
% 2.48/0.73 # Propositional unsat checks : 0
% 2.48/0.73 # Propositional check models : 0
% 2.48/0.73 # Propositional check unsatisfiable : 0
% 2.48/0.73 # Propositional clauses : 0
% 2.48/0.73 # Propositional clauses after purity: 0
% 2.48/0.73 # Propositional unsat core size : 0
% 2.48/0.73 # Propositional preprocessing time : 0.000
% 2.48/0.73 # Propositional encoding time : 0.000
% 2.48/0.73 # Propositional solver time : 0.000
% 2.48/0.73 # Success case prop preproc time : 0.000
% 2.48/0.73 # Success case prop encoding time : 0.000
% 2.48/0.73 # Success case prop solver time : 0.000
% 2.48/0.73 # Current number of processed clauses : 458
% 2.48/0.73 # Positive orientable unit clauses : 72
% 2.48/0.73 # Positive unorientable unit clauses: 1
% 2.48/0.73 # Negative unit clauses : 10
% 2.48/0.73 # Non-unit-clauses : 375
% 2.48/0.73 # Current number of unprocessed clauses: 5184
% 2.48/0.73 # ...number of literals in the above : 17461
% 2.48/0.73 # Current number of archived formulas : 0
% 2.48/0.73 # Current number of archived clauses : 497
% 2.48/0.73 # Clause-clause subsumption calls (NU) : 64381
% 2.48/0.73 # Rec. Clause-clause subsumption calls : 37611
% 2.48/0.73 # Non-unit clause-clause subsumptions : 1228
% 2.48/0.73 # Unit Clause-clause subsumption calls : 2998
% 2.48/0.73 # Rewrite failures with RHS unbound : 0
% 2.48/0.73 # BW rewrite match attempts : 235
% 2.48/0.73 # BW rewrite match successes : 126
% 2.48/0.73 # Condensation attempts : 0
% 2.48/0.73 # Condensation successes : 0
% 2.48/0.73 # Termbank termtop insertions : 411688
% 2.48/0.73 # Search garbage collected termcells : 185
% 2.48/0.73
% 2.48/0.73 # -------------------------------------------------
% 2.48/0.73 # User time : 0.293 s
% 2.48/0.73 # System time : 0.006 s
% 2.48/0.73 # Total time : 0.299 s
% 2.48/0.73 # Maximum resident set size: 2020 pages
% 2.48/0.73
% 2.48/0.73 # -------------------------------------------------
% 2.48/0.73 # User time : 1.435 s
% 2.48/0.73 # System time : 0.028 s
% 2.48/0.73 # Total time : 1.463 s
% 2.48/0.73 # Maximum resident set size: 1788 pages
% 2.48/0.73 % E---3.1 exiting
%------------------------------------------------------------------------------