TSTP Solution File: SET168-6 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET168-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:21 EDT 2023
% Result : Unsatisfiable 0.18s 0.47s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 13 unt; 3 nHn; 16 RR)
% Number of literals : 37 ( 2 equ; 16 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 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.S1HIFHTNuo/E---3.1_13033.p',subclass_members) ).
cnf(prove_members_of_union3_1,negated_conjecture,
member(x,z),
file('/export/starexec/sandbox/tmp/tmp.S1HIFHTNuo/E---3.1_13033.p',prove_members_of_union3_1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/tmp/tmp.S1HIFHTNuo/E---3.1_13033.p',class_elements_are_sets) ).
cnf(prove_members_of_union3_2,negated_conjecture,
~ member(x,union(y,z)),
file('/export/starexec/sandbox/tmp/tmp.S1HIFHTNuo/E---3.1_13033.p',prove_members_of_union3_2) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.S1HIFHTNuo/E---3.1_13033.p',union) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.S1HIFHTNuo/E---3.1_13033.p',complement2) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.S1HIFHTNuo/E---3.1_13033.p',intersection2) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.S1HIFHTNuo/E---3.1_13033.p',complement1) ).
cnf(c_0_8,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_9,negated_conjecture,
member(x,z),
prove_members_of_union3_1 ).
cnf(c_0_10,negated_conjecture,
( member(x,X1)
| ~ subclass(z,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_12,negated_conjecture,
~ member(x,union(y,z)),
prove_members_of_union3_2 ).
cnf(c_0_13,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_14,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_15,negated_conjecture,
member(x,universal_class),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
~ member(x,complement(intersection(complement(y),complement(z)))),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( member(x,complement(X1))
| member(x,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_19,negated_conjecture,
member(x,intersection(complement(y),complement(z))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_21,negated_conjecture,
member(x,complement(z)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET168-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n032.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 16:32:34 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.44 Running first-order model finding
% 0.18/0.44 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/tmp/tmp.S1HIFHTNuo/E---3.1_13033.p
% 0.18/0.47 # Version: 3.1pre001
% 0.18/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 # Starting sh5l with 300s (1) cores
% 0.18/0.47 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 13112 completed with status 0
% 0.18/0.47 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.18/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.47 # No SInE strategy applied
% 0.18/0.47 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.18/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.18/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 308s (1) cores
% 0.18/0.47 # Starting sh5l with 304s (1) cores
% 0.18/0.47 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.18/0.47 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 13119 completed with status 0
% 0.18/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.47 # No SInE strategy applied
% 0.18/0.47 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.18/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.18/0.47 # Preprocessing time : 0.003 s
% 0.18/0.47 # Presaturation interreduction done
% 0.18/0.47
% 0.18/0.47 # Proof found!
% 0.18/0.47 # SZS status Unsatisfiable
% 0.18/0.47 # SZS output start CNFRefutation
% See solution above
% 0.18/0.47 # Parsed axioms : 114
% 0.18/0.47 # Removed by relevancy pruning/SinE : 0
% 0.18/0.47 # Initial clauses : 114
% 0.18/0.47 # Removed in clause preprocessing : 17
% 0.18/0.47 # Initial clauses in saturation : 97
% 0.18/0.47 # Processed clauses : 153
% 0.18/0.47 # ...of these trivial : 0
% 0.18/0.47 # ...subsumed : 0
% 0.18/0.47 # ...remaining for further processing : 153
% 0.18/0.47 # Other redundant clauses eliminated : 4
% 0.18/0.47 # Clauses deleted for lack of memory : 0
% 0.18/0.47 # Backward-subsumed : 0
% 0.18/0.47 # Backward-rewritten : 0
% 0.18/0.47 # Generated clauses : 50
% 0.18/0.47 # ...of the previous two non-redundant : 42
% 0.18/0.47 # ...aggressively subsumed : 0
% 0.18/0.47 # Contextual simplify-reflections : 0
% 0.18/0.47 # Paramodulations : 46
% 0.18/0.47 # Factorizations : 0
% 0.18/0.47 # NegExts : 0
% 0.18/0.47 # Equation resolutions : 4
% 0.18/0.47 # Total rewrite steps : 6
% 0.18/0.47 # Propositional unsat checks : 0
% 0.18/0.47 # Propositional check models : 0
% 0.18/0.47 # Propositional check unsatisfiable : 0
% 0.18/0.47 # Propositional clauses : 0
% 0.18/0.47 # Propositional clauses after purity: 0
% 0.18/0.47 # Propositional unsat core size : 0
% 0.18/0.47 # Propositional preprocessing time : 0.000
% 0.18/0.47 # Propositional encoding time : 0.000
% 0.18/0.47 # Propositional solver time : 0.000
% 0.18/0.47 # Success case prop preproc time : 0.000
% 0.18/0.47 # Success case prop encoding time : 0.000
% 0.18/0.47 # Success case prop solver time : 0.000
% 0.18/0.47 # Current number of processed clauses : 53
% 0.18/0.47 # Positive orientable unit clauses : 18
% 0.18/0.47 # Positive unorientable unit clauses: 0
% 0.18/0.47 # Negative unit clauses : 2
% 0.18/0.47 # Non-unit-clauses : 33
% 0.18/0.47 # Current number of unprocessed clauses: 81
% 0.18/0.47 # ...number of literals in the above : 185
% 0.18/0.47 # Current number of archived formulas : 0
% 0.18/0.47 # Current number of archived clauses : 113
% 0.18/0.47 # Clause-clause subsumption calls (NU) : 1380
% 0.18/0.47 # Rec. Clause-clause subsumption calls : 649
% 0.18/0.47 # Non-unit clause-clause subsumptions : 0
% 0.18/0.47 # Unit Clause-clause subsumption calls : 42
% 0.18/0.47 # Rewrite failures with RHS unbound : 0
% 0.18/0.47 # BW rewrite match attempts : 4
% 0.18/0.47 # BW rewrite match successes : 1
% 0.18/0.47 # Condensation attempts : 0
% 0.18/0.47 # Condensation successes : 0
% 0.18/0.47 # Termbank termtop insertions : 7321
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.012 s
% 0.18/0.47 # System time : 0.003 s
% 0.18/0.47 # Total time : 0.015 s
% 0.18/0.47 # Maximum resident set size: 2004 pages
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.039 s
% 0.18/0.47 # System time : 0.011 s
% 0.18/0.47 # Total time : 0.050 s
% 0.18/0.47 # Maximum resident set size: 1776 pages
% 0.18/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------