TSTP Solution File: SET166-6 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET166-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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.22s 0.54s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 15 unt; 2 nHn; 19 RR)
% Number of literals : 41 ( 2 equ; 23 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; 4 con; 0-2 aty)
% Number of variables : 28 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_members_of_union1_1,negated_conjecture,
member(x,union(y,z)),
file('/export/starexec/sandbox2/tmp/tmp.Ew6QooPFaG/E---3.1_18465.p',prove_members_of_union1_1) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.Ew6QooPFaG/E---3.1_18465.p',union) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.Ew6QooPFaG/E---3.1_18465.p',complement1) ).
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Ew6QooPFaG/E---3.1_18465.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.Ew6QooPFaG/E---3.1_18465.p',class_elements_are_sets) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.Ew6QooPFaG/E---3.1_18465.p',intersection3) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.Ew6QooPFaG/E---3.1_18465.p',complement2) ).
cnf(prove_members_of_union1_3,negated_conjecture,
~ member(x,z),
file('/export/starexec/sandbox2/tmp/tmp.Ew6QooPFaG/E---3.1_18465.p',prove_members_of_union1_3) ).
cnf(prove_members_of_union1_2,negated_conjecture,
~ member(x,y),
file('/export/starexec/sandbox2/tmp/tmp.Ew6QooPFaG/E---3.1_18465.p',prove_members_of_union1_2) ).
cnf(c_0_9,negated_conjecture,
member(x,union(y,z)),
prove_members_of_union1_1 ).
cnf(c_0_10,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_11,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_12,negated_conjecture,
member(x,complement(intersection(complement(y),complement(z)))),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_14,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_15,negated_conjecture,
~ member(x,intersection(complement(y),complement(z))),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_17,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( ~ member(x,complement(z))
| ~ member(x,complement(y)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_20,negated_conjecture,
member(x,universal_class),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_21,negated_conjecture,
~ member(x,z),
prove_members_of_union1_3 ).
cnf(c_0_22,negated_conjecture,
~ member(x,complement(y)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_23,negated_conjecture,
~ member(x,y),
prove_members_of_union1_2 ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_19]),c_0_20])]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET166-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n006.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 17:47:40 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.50 Running first-order model finding
% 0.22/0.50 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.Ew6QooPFaG/E---3.1_18465.p
% 0.22/0.53 # Version: 3.1pre001
% 0.22/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 18542 completed with status 0
% 0.22/0.53 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.22/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.22/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 308s (1) cores
% 0.22/0.53 # Starting sh5l with 304s (1) cores
% 0.22/0.53 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.22/0.54 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 18552 completed with status 0
% 0.22/0.54 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.22/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.54 # No SInE strategy applied
% 0.22/0.54 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.22/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.22/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/0.54 # Preprocessing time : 0.003 s
% 0.22/0.54 # Presaturation interreduction done
% 0.22/0.54
% 0.22/0.54 # Proof found!
% 0.22/0.54 # SZS status Unsatisfiable
% 0.22/0.54 # SZS output start CNFRefutation
% See solution above
% 0.22/0.54 # Parsed axioms : 115
% 0.22/0.54 # Removed by relevancy pruning/SinE : 0
% 0.22/0.54 # Initial clauses : 115
% 0.22/0.54 # Removed in clause preprocessing : 17
% 0.22/0.54 # Initial clauses in saturation : 98
% 0.22/0.54 # Processed clauses : 168
% 0.22/0.54 # ...of these trivial : 0
% 0.22/0.54 # ...subsumed : 2
% 0.22/0.54 # ...remaining for further processing : 166
% 0.22/0.54 # Other redundant clauses eliminated : 4
% 0.22/0.54 # Clauses deleted for lack of memory : 0
% 0.22/0.54 # Backward-subsumed : 1
% 0.22/0.54 # Backward-rewritten : 1
% 0.22/0.54 # Generated clauses : 83
% 0.22/0.54 # ...of the previous two non-redundant : 68
% 0.22/0.54 # ...aggressively subsumed : 0
% 0.22/0.54 # Contextual simplify-reflections : 0
% 0.22/0.54 # Paramodulations : 79
% 0.22/0.54 # Factorizations : 0
% 0.22/0.54 # NegExts : 0
% 0.22/0.54 # Equation resolutions : 4
% 0.22/0.54 # Total rewrite steps : 11
% 0.22/0.54 # Propositional unsat checks : 0
% 0.22/0.54 # Propositional check models : 0
% 0.22/0.54 # Propositional check unsatisfiable : 0
% 0.22/0.54 # Propositional clauses : 0
% 0.22/0.54 # Propositional clauses after purity: 0
% 0.22/0.54 # Propositional unsat core size : 0
% 0.22/0.54 # Propositional preprocessing time : 0.000
% 0.22/0.54 # Propositional encoding time : 0.000
% 0.22/0.54 # Propositional solver time : 0.000
% 0.22/0.54 # Success case prop preproc time : 0.000
% 0.22/0.54 # Success case prop encoding time : 0.000
% 0.22/0.54 # Success case prop solver time : 0.000
% 0.22/0.54 # Current number of processed clauses : 63
% 0.22/0.54 # Positive orientable unit clauses : 16
% 0.22/0.54 # Positive unorientable unit clauses: 0
% 0.22/0.54 # Negative unit clauses : 4
% 0.22/0.54 # Non-unit-clauses : 43
% 0.22/0.54 # Current number of unprocessed clauses: 95
% 0.22/0.54 # ...number of literals in the above : 225
% 0.22/0.54 # Current number of archived formulas : 0
% 0.22/0.54 # Current number of archived clauses : 116
% 0.22/0.54 # Clause-clause subsumption calls (NU) : 1486
% 0.22/0.54 # Rec. Clause-clause subsumption calls : 721
% 0.22/0.54 # Non-unit clause-clause subsumptions : 2
% 0.22/0.54 # Unit Clause-clause subsumption calls : 12
% 0.22/0.54 # Rewrite failures with RHS unbound : 0
% 0.22/0.54 # BW rewrite match attempts : 3
% 0.22/0.54 # BW rewrite match successes : 2
% 0.22/0.54 # Condensation attempts : 0
% 0.22/0.54 # Condensation successes : 0
% 0.22/0.54 # Termbank termtop insertions : 7671
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.015 s
% 0.22/0.54 # System time : 0.008 s
% 0.22/0.54 # Total time : 0.022 s
% 0.22/0.54 # Maximum resident set size: 2004 pages
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.060 s
% 0.22/0.54 # System time : 0.022 s
% 0.22/0.54 # Total time : 0.082 s
% 0.22/0.54 # Maximum resident set size: 1776 pages
% 0.22/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------