TSTP Solution File: SET199-6 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET199-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:18:51 EDT 2023
% Result : Unsatisfiable 0.16s 0.50s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of clauses : 34 ( 11 unt; 5 nHn; 28 RR)
% Number of literals : 64 ( 3 equ; 28 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 54 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/tmp.a3WBg77AvI/E---3.1_10553.p',not_subclass_members2) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.a3WBg77AvI/E---3.1_10553.p',intersection3) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.a3WBg77AvI/E---3.1_10553.p',not_subclass_members1) ).
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.a3WBg77AvI/E---3.1_10553.p',subclass_members) ).
cnf(prove_greatest_lower_bound_2,negated_conjecture,
subclass(z,y),
file('/export/starexec/sandbox/tmp/tmp.a3WBg77AvI/E---3.1_10553.p',prove_greatest_lower_bound_2) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.a3WBg77AvI/E---3.1_10553.p',intersection2) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.a3WBg77AvI/E---3.1_10553.p',intersection1) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.a3WBg77AvI/E---3.1_10553.p',subclass_implies_equal) ).
cnf(prove_greatest_lower_bound_1,negated_conjecture,
subclass(z,x),
file('/export/starexec/sandbox/tmp/tmp.a3WBg77AvI/E---3.1_10553.p',prove_greatest_lower_bound_1) ).
cnf(prove_greatest_lower_bound_3,negated_conjecture,
~ subclass(z,intersection(x,y)),
file('/export/starexec/sandbox/tmp/tmp.a3WBg77AvI/E---3.1_10553.p',prove_greatest_lower_bound_3) ).
cnf(c_0_10,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_11,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_12,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_10,c_0_11]) ).
cnf(c_0_13,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_14,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_15,negated_conjecture,
subclass(z,y),
prove_greatest_lower_bound_2 ).
cnf(c_0_16,plain,
( subclass(X1,intersection(X2,X1))
| ~ member(not_subclass_element(X1,intersection(X2,X1)),X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( member(X1,y)
| ~ member(X1,z) ),
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,
( subclass(X1,intersection(y,X1))
| ~ member(not_subclass_element(X1,intersection(y,X1)),z) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X2)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_21,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_22,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_23,negated_conjecture,
subclass(z,intersection(y,z)),
inference(spm,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_24,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_10,c_0_20]) ).
cnf(c_0_25,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_13]) ).
cnf(c_0_26,negated_conjecture,
intersection(y,z) = z,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_27,negated_conjecture,
( member(not_subclass_element(z,X1),y)
| subclass(z,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
subclass(z,x),
prove_greatest_lower_bound_1 ).
cnf(c_0_29,negated_conjecture,
( subclass(z,intersection(X1,y))
| ~ member(not_subclass_element(z,intersection(X1,y)),X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( member(X1,x)
| ~ member(X1,z) ),
inference(spm,[status(thm)],[c_0_14,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
~ subclass(z,intersection(x,y)),
prove_greatest_lower_bound_3 ).
cnf(c_0_32,negated_conjecture,
~ member(not_subclass_element(z,intersection(x,y)),z),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_13]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET199-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n007.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 16:47:54 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.a3WBg77AvI/E---3.1_10553.p
% 0.16/0.50 # Version: 3.1pre001
% 0.16/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.50 # Starting sh5l with 300s (1) cores
% 0.16/0.50 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 10631 completed with status 0
% 0.16/0.50 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.50 # No SInE strategy applied
% 0.16/0.50 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.16/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.16/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.50 # Starting new_bool_1 with 308s (1) cores
% 0.16/0.50 # Starting sh5l with 304s (1) cores
% 0.16/0.50 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.50 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 10639 completed with status 0
% 0.16/0.50 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.50 # No SInE strategy applied
% 0.16/0.50 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.16/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.16/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.50 # Preprocessing time : 0.003 s
% 0.16/0.50 # Presaturation interreduction done
% 0.16/0.50
% 0.16/0.50 # Proof found!
% 0.16/0.50 # SZS status Unsatisfiable
% 0.16/0.50 # SZS output start CNFRefutation
% See solution above
% 0.16/0.50 # Parsed axioms : 115
% 0.16/0.50 # Removed by relevancy pruning/SinE : 0
% 0.16/0.50 # Initial clauses : 115
% 0.16/0.50 # Removed in clause preprocessing : 17
% 0.16/0.50 # Initial clauses in saturation : 98
% 0.16/0.50 # Processed clauses : 638
% 0.16/0.50 # ...of these trivial : 5
% 0.16/0.50 # ...subsumed : 193
% 0.16/0.50 # ...remaining for further processing : 440
% 0.16/0.50 # Other redundant clauses eliminated : 6
% 0.16/0.50 # Clauses deleted for lack of memory : 0
% 0.16/0.50 # Backward-subsumed : 6
% 0.16/0.50 # Backward-rewritten : 30
% 0.16/0.50 # Generated clauses : 1430
% 0.16/0.50 # ...of the previous two non-redundant : 1218
% 0.16/0.50 # ...aggressively subsumed : 0
% 0.16/0.50 # Contextual simplify-reflections : 5
% 0.16/0.50 # Paramodulations : 1422
% 0.16/0.50 # Factorizations : 2
% 0.16/0.50 # NegExts : 0
% 0.16/0.50 # Equation resolutions : 6
% 0.16/0.50 # Total rewrite steps : 342
% 0.16/0.50 # Propositional unsat checks : 0
% 0.16/0.50 # Propositional check models : 0
% 0.16/0.50 # Propositional check unsatisfiable : 0
% 0.16/0.50 # Propositional clauses : 0
% 0.16/0.50 # Propositional clauses after purity: 0
% 0.16/0.50 # Propositional unsat core size : 0
% 0.16/0.50 # Propositional preprocessing time : 0.000
% 0.16/0.50 # Propositional encoding time : 0.000
% 0.16/0.50 # Propositional solver time : 0.000
% 0.16/0.50 # Success case prop preproc time : 0.000
% 0.16/0.50 # Success case prop encoding time : 0.000
% 0.16/0.50 # Success case prop solver time : 0.000
% 0.16/0.50 # Current number of processed clauses : 303
% 0.16/0.50 # Positive orientable unit clauses : 53
% 0.16/0.50 # Positive unorientable unit clauses: 1
% 0.16/0.50 # Negative unit clauses : 4
% 0.16/0.50 # Non-unit-clauses : 245
% 0.16/0.50 # Current number of unprocessed clauses: 733
% 0.16/0.50 # ...number of literals in the above : 2030
% 0.16/0.50 # Current number of archived formulas : 0
% 0.16/0.50 # Current number of archived clauses : 150
% 0.16/0.50 # Clause-clause subsumption calls (NU) : 11870
% 0.16/0.50 # Rec. Clause-clause subsumption calls : 6747
% 0.16/0.50 # Non-unit clause-clause subsumptions : 170
% 0.16/0.50 # Unit Clause-clause subsumption calls : 625
% 0.16/0.50 # Rewrite failures with RHS unbound : 0
% 0.16/0.50 # BW rewrite match attempts : 77
% 0.16/0.50 # BW rewrite match successes : 14
% 0.16/0.50 # Condensation attempts : 0
% 0.16/0.50 # Condensation successes : 0
% 0.16/0.50 # Termbank termtop insertions : 35082
% 0.16/0.50
% 0.16/0.50 # -------------------------------------------------
% 0.16/0.50 # User time : 0.050 s
% 0.16/0.50 # System time : 0.006 s
% 0.16/0.50 # Total time : 0.056 s
% 0.16/0.50 # Maximum resident set size: 2004 pages
% 0.16/0.50
% 0.16/0.50 # -------------------------------------------------
% 0.16/0.50 # User time : 0.253 s
% 0.16/0.50 # System time : 0.016 s
% 0.16/0.50 # Total time : 0.269 s
% 0.16/0.50 # Maximum resident set size: 1776 pages
% 0.16/0.50 % E---3.1 exiting
% 0.16/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------