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