TSTP Solution File: SET062-6 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET062-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:14 EDT 2023
% Result : Unsatisfiable 0.56s 0.55s
% Output : CNFRefutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 31 ( 10 unt; 11 nHn; 19 RR)
% Number of literals : 57 ( 14 equ; 20 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 40 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.U7sbHy2VFI/E---3.1_4895.p',subclass_members) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox/tmp/tmp.U7sbHy2VFI/E---3.1_4895.p',regularity1) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.U7sbHy2VFI/E---3.1_4895.p',complement1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/tmp/tmp.U7sbHy2VFI/E---3.1_4895.p',class_elements_are_sets) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.U7sbHy2VFI/E---3.1_4895.p',not_subclass_members1) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.U7sbHy2VFI/E---3.1_4895.p',intersection1) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox/tmp/tmp.U7sbHy2VFI/E---3.1_4895.p',regularity2) ).
cnf(prove_null_class_is_subclass_1,negated_conjecture,
~ subclass(null_class,x),
file('/export/starexec/sandbox/tmp/tmp.U7sbHy2VFI/E---3.1_4895.p',prove_null_class_is_subclass_1) ).
cnf(omega_in_universal,axiom,
member(omega,universal_class),
file('/export/starexec/sandbox/tmp/tmp.U7sbHy2VFI/E---3.1_4895.p',omega_in_universal) ).
cnf(c_0_9,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_10,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_11,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_12,plain,
( X1 = null_class
| member(regular(X1),X2)
| ~ subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_14,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_15,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_16,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_18,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_19,plain,
( subclass(complement(X1),X2)
| ~ member(not_subclass_element(complement(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_20,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( X1 = null_class
| member(X2,X1)
| ~ member(X2,null_class) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( subclass(null_class,X1)
| ~ member(not_subclass_element(null_class,X1),universal_class) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( X1 = null_class
| member(not_subclass_element(null_class,X2),X1)
| subclass(null_class,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_14]) ).
cnf(c_0_24,negated_conjecture,
~ subclass(null_class,x),
prove_null_class_is_subclass_1 ).
cnf(c_0_25,plain,
( null_class = universal_class
| subclass(null_class,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( ~ member(X1,null_class)
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_11,c_0_20]) ).
cnf(c_0_27,negated_conjecture,
null_class = universal_class,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,axiom,
member(omega,universal_class),
omega_in_universal ).
cnf(c_0_29,plain,
~ member(X1,universal_class),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_30,plain,
$false,
inference(sr,[status(thm)],[c_0_28,c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : SET062-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n021.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 16:41:14 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 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.U7sbHy2VFI/E---3.1_4895.p
% 0.56/0.55 # Version: 3.1pre001
% 0.56/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.56/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.56/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.56/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.56/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.56/0.55 # Starting sh5l with 300s (1) cores
% 0.56/0.55 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 5021 completed with status 0
% 0.56/0.55 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.56/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.56/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.56/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.56/0.55 # No SInE strategy applied
% 0.56/0.55 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.56/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.56/0.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.56/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.56/0.55 # Starting new_bool_1 with 308s (1) cores
% 0.56/0.55 # Starting sh5l with 304s (1) cores
% 0.56/0.55 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.56/0.55 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 5029 completed with status 0
% 0.56/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.56/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.56/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.56/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.56/0.55 # No SInE strategy applied
% 0.56/0.55 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.56/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.56/0.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.56/0.55 # Preprocessing time : 0.005 s
% 0.56/0.55 # Presaturation interreduction done
% 0.56/0.55
% 0.56/0.55 # Proof found!
% 0.56/0.55 # SZS status Unsatisfiable
% 0.56/0.55 # SZS output start CNFRefutation
% See solution above
% 0.56/0.55 # Parsed axioms : 92
% 0.56/0.55 # Removed by relevancy pruning/SinE : 0
% 0.56/0.55 # Initial clauses : 92
% 0.56/0.55 # Removed in clause preprocessing : 15
% 0.56/0.55 # Initial clauses in saturation : 77
% 0.56/0.55 # Processed clauses : 229
% 0.56/0.55 # ...of these trivial : 0
% 0.56/0.55 # ...subsumed : 20
% 0.56/0.55 # ...remaining for further processing : 209
% 0.56/0.55 # Other redundant clauses eliminated : 3
% 0.56/0.55 # Clauses deleted for lack of memory : 0
% 0.56/0.55 # Backward-subsumed : 7
% 0.56/0.55 # Backward-rewritten : 53
% 0.56/0.55 # Generated clauses : 241
% 0.56/0.55 # ...of the previous two non-redundant : 249
% 0.56/0.55 # ...aggressively subsumed : 0
% 0.56/0.55 # Contextual simplify-reflections : 0
% 0.56/0.55 # Paramodulations : 236
% 0.56/0.55 # Factorizations : 0
% 0.56/0.55 # NegExts : 0
% 0.56/0.55 # Equation resolutions : 3
% 0.56/0.55 # Total rewrite steps : 108
% 0.56/0.55 # Propositional unsat checks : 0
% 0.56/0.55 # Propositional check models : 0
% 0.56/0.55 # Propositional check unsatisfiable : 0
% 0.56/0.55 # Propositional clauses : 0
% 0.56/0.55 # Propositional clauses after purity: 0
% 0.56/0.55 # Propositional unsat core size : 0
% 0.56/0.55 # Propositional preprocessing time : 0.000
% 0.56/0.55 # Propositional encoding time : 0.000
% 0.56/0.55 # Propositional solver time : 0.000
% 0.56/0.55 # Success case prop preproc time : 0.000
% 0.56/0.55 # Success case prop encoding time : 0.000
% 0.56/0.55 # Success case prop solver time : 0.000
% 0.56/0.55 # Current number of processed clauses : 68
% 0.56/0.55 # Positive orientable unit clauses : 15
% 0.56/0.55 # Positive unorientable unit clauses: 1
% 0.56/0.55 # Negative unit clauses : 1
% 0.56/0.55 # Non-unit-clauses : 51
% 0.56/0.55 # Current number of unprocessed clauses: 173
% 0.56/0.55 # ...number of literals in the above : 463
% 0.56/0.55 # Current number of archived formulas : 0
% 0.56/0.55 # Current number of archived clauses : 153
% 0.56/0.55 # Clause-clause subsumption calls (NU) : 4529
% 0.56/0.55 # Rec. Clause-clause subsumption calls : 2054
% 0.56/0.55 # Non-unit clause-clause subsumptions : 22
% 0.56/0.55 # Unit Clause-clause subsumption calls : 70
% 0.56/0.55 # Rewrite failures with RHS unbound : 0
% 0.56/0.55 # BW rewrite match attempts : 10
% 0.56/0.55 # BW rewrite match successes : 5
% 0.56/0.55 # Condensation attempts : 0
% 0.56/0.55 # Condensation successes : 0
% 0.56/0.55 # Termbank termtop insertions : 9113
% 0.56/0.55
% 0.56/0.55 # -------------------------------------------------
% 0.56/0.55 # User time : 0.022 s
% 0.56/0.55 # System time : 0.009 s
% 0.56/0.55 # Total time : 0.030 s
% 0.56/0.55 # Maximum resident set size: 1940 pages
% 0.56/0.55
% 0.56/0.55 # -------------------------------------------------
% 0.56/0.55 # User time : 0.084 s
% 0.56/0.55 # System time : 0.031 s
% 0.56/0.55 # Total time : 0.115 s
% 0.56/0.55 # Maximum resident set size: 1752 pages
% 0.56/0.55 % E---3.1 exiting
% 0.56/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------