TSTP Solution File: SET147-6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET147-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:18:13 EDT 2024
% Result : Unsatisfiable 0.35s 0.57s
% Output : CNFRefutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 31 ( 9 unt; 4 nHn; 22 RR)
% Number of literals : 63 ( 7 equ; 31 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 61 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.IbFz1J7Eai/E---3.1_21160.p',not_subclass_members2) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.IbFz1J7Eai/E---3.1_21160.p',intersection3) ).
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.IbFz1J7Eai/E---3.1_21160.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.IbFz1J7Eai/E---3.1_21160.p',class_elements_are_sets) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.IbFz1J7Eai/E---3.1_21160.p',intersection2) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.IbFz1J7Eai/E---3.1_21160.p',not_subclass_members1) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.IbFz1J7Eai/E---3.1_21160.p',subclass_implies_equal) ).
cnf(prove_identity_for_intersection_1,negated_conjecture,
intersection(universal_class,x) != x,
file('/export/starexec/sandbox2/tmp/tmp.IbFz1J7Eai/E---3.1_21160.p',prove_identity_for_intersection_1) ).
cnf(c_0_8,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_9,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_10,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_11,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
c_0_8 ).
cnf(c_0_12,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
c_0_9 ).
cnf(c_0_13,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
c_0_10 ).
cnf(c_0_14,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_15,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_16,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_11,c_0_12]) ).
cnf(c_0_17,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_18,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
c_0_15 ).
cnf(c_0_20,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_21,plain,
( subclass(X1,intersection(X2,X1))
| ~ member(not_subclass_element(X1,intersection(X2,X1)),X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( member(not_subclass_element(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_23,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X2)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
intersection(universal_class,x) != x,
inference(fof_simplification,[status(thm)],[prove_identity_for_intersection_1]) ).
cnf(c_0_25,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
c_0_20 ).
cnf(c_0_26,plain,
subclass(X1,intersection(universal_class,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_11,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
intersection(universal_class,x) != x,
c_0_24 ).
cnf(c_0_29,plain,
intersection(universal_class,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET147-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 09:57:06 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.IbFz1J7Eai/E---3.1_21160.p
% 0.35/0.57 # Version: 3.1.0
% 0.35/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.35/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.35/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.35/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.35/0.57 # Starting sh5l with 300s (1) cores
% 0.35/0.57 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 21283 completed with status 0
% 0.35/0.57 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.35/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.35/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.35/0.57 # No SInE strategy applied
% 0.35/0.57 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.35/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.35/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.35/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.35/0.57 # Starting new_bool_1 with 308s (1) cores
% 0.35/0.57 # Starting sh5l with 304s (1) cores
% 0.35/0.57 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.35/0.57 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 21300 completed with status 0
% 0.35/0.57 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.35/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.35/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.35/0.57 # No SInE strategy applied
% 0.35/0.57 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.35/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.35/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.35/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.35/0.57 # Preprocessing time : 0.003 s
% 0.35/0.57 # Presaturation interreduction done
% 0.35/0.57
% 0.35/0.57 # Proof found!
% 0.35/0.57 # SZS status Unsatisfiable
% 0.35/0.57 # SZS output start CNFRefutation
% See solution above
% 0.35/0.57 # Parsed axioms : 113
% 0.35/0.57 # Removed by relevancy pruning/SinE : 0
% 0.35/0.57 # Initial clauses : 113
% 0.35/0.57 # Removed in clause preprocessing : 17
% 0.35/0.57 # Initial clauses in saturation : 96
% 0.35/0.57 # Processed clauses : 541
% 0.35/0.57 # ...of these trivial : 4
% 0.35/0.57 # ...subsumed : 142
% 0.35/0.57 # ...remaining for further processing : 395
% 0.35/0.57 # Other redundant clauses eliminated : 6
% 0.35/0.57 # Clauses deleted for lack of memory : 0
% 0.35/0.57 # Backward-subsumed : 7
% 0.35/0.57 # Backward-rewritten : 35
% 0.35/0.57 # Generated clauses : 1135
% 0.35/0.57 # ...of the previous two non-redundant : 1006
% 0.35/0.57 # ...aggressively subsumed : 0
% 0.35/0.57 # Contextual simplify-reflections : 7
% 0.35/0.57 # Paramodulations : 1127
% 0.35/0.57 # Factorizations : 2
% 0.35/0.57 # NegExts : 0
% 0.35/0.57 # Equation resolutions : 6
% 0.35/0.57 # Disequality decompositions : 0
% 0.35/0.57 # Total rewrite steps : 198
% 0.35/0.57 # ...of those cached : 143
% 0.35/0.57 # Propositional unsat checks : 0
% 0.35/0.57 # Propositional check models : 0
% 0.35/0.57 # Propositional check unsatisfiable : 0
% 0.35/0.57 # Propositional clauses : 0
% 0.35/0.57 # Propositional clauses after purity: 0
% 0.35/0.57 # Propositional unsat core size : 0
% 0.35/0.57 # Propositional preprocessing time : 0.000
% 0.35/0.57 # Propositional encoding time : 0.000
% 0.35/0.57 # Propositional solver time : 0.000
% 0.35/0.57 # Success case prop preproc time : 0.000
% 0.35/0.57 # Success case prop encoding time : 0.000
% 0.35/0.57 # Success case prop solver time : 0.000
% 0.35/0.57 # Current number of processed clauses : 254
% 0.35/0.57 # Positive orientable unit clauses : 43
% 0.35/0.57 # Positive unorientable unit clauses: 1
% 0.35/0.57 # Negative unit clauses : 2
% 0.35/0.57 # Non-unit-clauses : 208
% 0.35/0.57 # Current number of unprocessed clauses: 619
% 0.35/0.57 # ...number of literals in the above : 1816
% 0.35/0.57 # Current number of archived formulas : 0
% 0.35/0.57 # Current number of archived clauses : 154
% 0.35/0.57 # Clause-clause subsumption calls (NU) : 9418
% 0.35/0.57 # Rec. Clause-clause subsumption calls : 5305
% 0.35/0.57 # Non-unit clause-clause subsumptions : 123
% 0.35/0.57 # Unit Clause-clause subsumption calls : 495
% 0.35/0.57 # Rewrite failures with RHS unbound : 0
% 0.35/0.57 # BW rewrite match attempts : 60
% 0.35/0.57 # BW rewrite match successes : 11
% 0.35/0.57 # Condensation attempts : 0
% 0.35/0.57 # Condensation successes : 0
% 0.35/0.57 # Termbank termtop insertions : 36252
% 0.35/0.57 # Search garbage collected termcells : 185
% 0.35/0.57
% 0.35/0.57 # -------------------------------------------------
% 0.35/0.57 # User time : 0.055 s
% 0.35/0.57 # System time : 0.008 s
% 0.35/0.57 # Total time : 0.064 s
% 0.35/0.57 # Maximum resident set size: 1988 pages
% 0.35/0.57
% 0.35/0.57 # -------------------------------------------------
% 0.35/0.57 # User time : 0.265 s
% 0.35/0.57 # System time : 0.021 s
% 0.35/0.57 # Total time : 0.286 s
% 0.35/0.57 # Maximum resident set size: 1788 pages
% 0.35/0.57 % E---3.1 exiting
% 0.35/0.58 % E exiting
%------------------------------------------------------------------------------