TSTP Solution File: SET347-6 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET347-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:19:06 EDT 2023
% Result : Unsatisfiable 1641.86s 216.91s
% Output : CNFRefutation 1641.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of clauses : 52 ( 22 unt; 9 nHn; 34 RR)
% Number of literals : 89 ( 34 equ; 37 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 5 con; 0-3 aty)
% Number of variables : 83 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.dVGzdb1EbK/E---3.1_22433.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/tmp/tmp.dVGzdb1EbK/E---3.1_22433.p',class_elements_are_sets) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.dVGzdb1EbK/E---3.1_22433.p',complement1) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox/tmp/tmp.dVGzdb1EbK/E---3.1_22433.p',regularity1) ).
cnf(cartesian_product4,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.dVGzdb1EbK/E---3.1_22433.p',cartesian_product4) ).
cnf(domain1,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.dVGzdb1EbK/E---3.1_22433.p',domain1) ).
cnf(sum_class_definition,axiom,
domain_of(restrict(element_relation,universal_class,X1)) = sum_class(X1),
file('/export/starexec/sandbox/tmp/tmp.dVGzdb1EbK/E---3.1_22433.p',sum_class_definition) ).
cnf(cartesian_product2,axiom,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox/tmp/tmp.dVGzdb1EbK/E---3.1_22433.p',cartesian_product2) ).
cnf(choice2,axiom,
( X1 = null_class
| member(apply(choice,X1),X1)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.dVGzdb1EbK/E---3.1_22433.p',choice2) ).
cnf(inductive1,axiom,
( member(null_class,X1)
| ~ inductive(X1) ),
file('/export/starexec/sandbox/tmp/tmp.dVGzdb1EbK/E---3.1_22433.p',inductive1) ).
cnf(omega_is_inductive1,axiom,
inductive(omega),
file('/export/starexec/sandbox/tmp/tmp.dVGzdb1EbK/E---3.1_22433.p',omega_is_inductive1) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.dVGzdb1EbK/E---3.1_22433.p',intersection2) ).
cnf(sum_class2,axiom,
( member(sum_class(X1),universal_class)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.dVGzdb1EbK/E---3.1_22433.p',sum_class2) ).
cnf(prove_sum_class_of_null_class_1,negated_conjecture,
sum_class(null_class) != null_class,
file('/export/starexec/sandbox/tmp/tmp.dVGzdb1EbK/E---3.1_22433.p',prove_sum_class_of_null_class_1) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox/tmp/tmp.dVGzdb1EbK/E---3.1_22433.p',restriction1) ).
cnf(restriction2,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
file('/export/starexec/sandbox/tmp/tmp.dVGzdb1EbK/E---3.1_22433.p',restriction2) ).
cnf(c_0_16,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_17,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_18,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_19,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_20,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
cartesian_product4 ).
cnf(c_0_22,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
domain1 ).
cnf(c_0_23,axiom,
domain_of(restrict(element_relation,universal_class,X1)) = sum_class(X1),
sum_class_definition ).
cnf(c_0_24,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_26,axiom,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
cartesian_product2 ).
cnf(c_0_27,plain,
( ordered_pair(first(regular(cross_product(X1,X2))),second(regular(cross_product(X1,X2)))) = regular(cross_product(X1,X2))
| cross_product(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_28,plain,
( restrict(restrict(element_relation,universal_class,X1),singleton(X2),universal_class) != null_class
| ~ member(X2,sum_class(X1)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,axiom,
( X1 = null_class
| member(apply(choice,X1),X1)
| ~ member(X1,universal_class) ),
choice2 ).
cnf(c_0_30,axiom,
( member(null_class,X1)
| ~ inductive(X1) ),
inductive1 ).
cnf(c_0_31,axiom,
inductive(omega),
omega_is_inductive1 ).
cnf(c_0_32,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,plain,
( cross_product(X1,X2) = null_class
| member(second(regular(cross_product(X1,X2))),X3)
| ~ member(regular(cross_product(X1,X2)),cross_product(X4,X3)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_35,plain,
( sum_class(X1) = null_class
| restrict(restrict(element_relation,universal_class,X1),singleton(apply(choice,sum_class(X1))),universal_class) != null_class
| ~ member(sum_class(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,axiom,
( member(sum_class(X1),universal_class)
| ~ member(X1,universal_class) ),
sum_class2 ).
cnf(c_0_37,plain,
member(null_class,omega),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_32]),c_0_20]) ).
cnf(c_0_39,plain,
( cross_product(X1,X2) = null_class
| member(second(regular(cross_product(X1,X2))),X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_19]) ).
cnf(c_0_40,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_19]) ).
cnf(c_0_41,plain,
( sum_class(X1) = null_class
| restrict(restrict(element_relation,universal_class,X1),singleton(apply(choice,sum_class(X1))),universal_class) != null_class
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
member(null_class,universal_class),
inference(spm,[status(thm)],[c_0_20,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
sum_class(null_class) != null_class,
prove_sum_class_of_null_class_1 ).
cnf(c_0_44,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_45,plain,
cross_product(X1,null_class) = null_class,
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,plain,
intersection(X1,null_class) = null_class,
inference(spm,[status(thm)],[c_0_38,c_0_40]) ).
cnf(c_0_47,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_48,plain,
restrict(restrict(element_relation,universal_class,null_class),singleton(apply(choice,sum_class(null_class))),universal_class) != null_class,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_49,plain,
restrict(X1,X2,null_class) = null_class,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_50,plain,
restrict(null_class,X1,X2) = null_class,
inference(spm,[status(thm)],[c_0_47,c_0_46]) ).
cnf(c_0_51,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SET347-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n024.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 17:41:57 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.dVGzdb1EbK/E---3.1_22433.p
% 1641.86/216.91 # Version: 3.1pre001
% 1641.86/216.91 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1641.86/216.91 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1641.86/216.91 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1641.86/216.91 # Starting new_bool_3 with 300s (1) cores
% 1641.86/216.91 # Starting new_bool_1 with 300s (1) cores
% 1641.86/216.91 # Starting sh5l with 300s (1) cores
% 1641.86/216.91 # sh5l with pid 22523 completed with status 0
% 1641.86/216.91 # Result found by sh5l
% 1641.86/216.91 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1641.86/216.91 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1641.86/216.91 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1641.86/216.91 # Starting new_bool_3 with 300s (1) cores
% 1641.86/216.91 # Starting new_bool_1 with 300s (1) cores
% 1641.86/216.91 # Starting sh5l with 300s (1) cores
% 1641.86/216.91 # SinE strategy is gf500_gu_R04_F100_L20000
% 1641.86/216.91 # Search class: FGHSM-FFMM31-MFFFFFNN
% 1641.86/216.91 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1641.86/216.91 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 1641.86/216.91 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 22526 completed with status 7
% 1641.86/216.91 # Starting sh5l with 31s (1) cores
% 1641.86/216.91 # sh5l with pid 22541 completed with status 7
% 1641.86/216.91 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 23s (1) cores
% 1641.86/216.91 # G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with pid 22546 completed with status 7
% 1641.86/216.91 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 23s (1) cores
% 1641.86/216.91 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 22550 completed with status 7
% 1641.86/216.91 # Starting U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 23s (1) cores
% 1641.86/216.91 # U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 22555 completed with status 7
% 1641.86/216.91 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 23s (1) cores
% 1641.86/216.91 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 22561 completed with status 7
% 1641.86/216.91 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 23s (1) cores
% 1641.86/216.91 # G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with pid 22567 completed with status 7
% 1641.86/216.91 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 23s (1) cores
% 1641.86/216.91 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with pid 22879 completed with status 7
% 1641.86/216.91 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 23s (1) cores
% 1641.86/216.91 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 24413 completed with status 0
% 1641.86/216.91 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I
% 1641.86/216.91 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1641.86/216.91 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1641.86/216.91 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1641.86/216.91 # Starting new_bool_3 with 300s (1) cores
% 1641.86/216.91 # Starting new_bool_1 with 300s (1) cores
% 1641.86/216.91 # Starting sh5l with 300s (1) cores
% 1641.86/216.91 # SinE strategy is gf500_gu_R04_F100_L20000
% 1641.86/216.91 # Search class: FGHSM-FFMM31-MFFFFFNN
% 1641.86/216.91 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1641.86/216.91 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 1641.86/216.91 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 22526 completed with status 7
% 1641.86/216.91 # Starting sh5l with 31s (1) cores
% 1641.86/216.91 # sh5l with pid 22541 completed with status 7
% 1641.86/216.91 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 23s (1) cores
% 1641.86/216.91 # G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with pid 22546 completed with status 7
% 1641.86/216.91 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 23s (1) cores
% 1641.86/216.91 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 22550 completed with status 7
% 1641.86/216.91 # Starting U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 23s (1) cores
% 1641.86/216.91 # U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 22555 completed with status 7
% 1641.86/216.91 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 23s (1) cores
% 1641.86/216.91 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 22561 completed with status 7
% 1641.86/216.91 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 23s (1) cores
% 1641.86/216.91 # G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with pid 22567 completed with status 7
% 1641.86/216.91 # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 23s (1) cores
% 1641.86/216.91 # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with pid 22879 completed with status 7
% 1641.86/216.91 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 23s (1) cores
% 1641.86/216.91 # Preprocessing time : 0.002 s
% 1641.86/216.91
% 1641.86/216.91 # Proof found!
% 1641.86/216.91 # SZS status Unsatisfiable
% 1641.86/216.91 # SZS output start CNFRefutation
% See solution above
% 1641.86/216.91 # Parsed axioms : 113
% 1641.86/216.91 # Removed by relevancy pruning/SinE : 14
% 1641.86/216.91 # Initial clauses : 99
% 1641.86/216.91 # Removed in clause preprocessing : 0
% 1641.86/216.91 # Initial clauses in saturation : 99
% 1641.86/216.91 # Processed clauses : 9802
% 1641.86/216.91 # ...of these trivial : 341
% 1641.86/216.91 # ...subsumed : 4149
% 1641.86/216.91 # ...remaining for further processing : 5312
% 1641.86/216.91 # Other redundant clauses eliminated : 14
% 1641.86/216.91 # Clauses deleted for lack of memory : 0
% 1641.86/216.91 # Backward-subsumed : 249
% 1641.86/216.91 # Backward-rewritten : 188
% 1641.86/216.91 # Generated clauses : 783599
% 1641.86/216.91 # ...of the previous two non-redundant : 748023
% 1641.86/216.91 # ...aggressively subsumed : 0
% 1641.86/216.91 # Contextual simplify-reflections : 80
% 1641.86/216.91 # Paramodulations : 783365
% 1641.86/216.91 # Factorizations : 219
% 1641.86/216.91 # NegExts : 0
% 1641.86/216.91 # Equation resolutions : 15
% 1641.86/216.91 # Total rewrite steps : 174598
% 1641.86/216.91 # Propositional unsat checks : 1
% 1641.86/216.91 # Propositional check models : 0
% 1641.86/216.91 # Propositional check unsatisfiable : 0
% 1641.86/216.91 # Propositional clauses : 0
% 1641.86/216.91 # Propositional clauses after purity: 0
% 1641.86/216.91 # Propositional unsat core size : 0
% 1641.86/216.91 # Propositional preprocessing time : 0.000
% 1641.86/216.91 # Propositional encoding time : 2.534
% 1641.86/216.91 # Propositional solver time : 0.726
% 1641.86/216.91 # Success case prop preproc time : 0.000
% 1641.86/216.91 # Success case prop encoding time : 0.000
% 1641.86/216.91 # Success case prop solver time : 0.000
% 1641.86/216.91 # Current number of processed clauses : 4873
% 1641.86/216.91 # Positive orientable unit clauses : 575
% 1641.86/216.91 # Positive unorientable unit clauses: 16
% 1641.86/216.91 # Negative unit clauses : 13
% 1641.86/216.91 # Non-unit-clauses : 4269
% 1641.86/216.91 # Current number of unprocessed clauses: 737213
% 1641.86/216.91 # ...number of literals in the above : 2475883
% 1641.86/216.91 # Current number of archived formulas : 0
% 1641.86/216.91 # Current number of archived clauses : 437
% 1641.86/216.91 # Clause-clause subsumption calls (NU) : 1660211
% 1641.86/216.91 # Rec. Clause-clause subsumption calls : 1021431
% 1641.86/216.91 # Non-unit clause-clause subsumptions : 3579
% 1641.86/216.91 # Unit Clause-clause subsumption calls : 75542
% 1641.86/216.91 # Rewrite failures with RHS unbound : 0
% 1641.86/216.91 # BW rewrite match attempts : 7013
% 1641.86/216.91 # BW rewrite match successes : 173
% 1641.86/216.91 # Condensation attempts : 0
% 1641.86/216.91 # Condensation successes : 0
% 1641.86/216.91 # Termbank termtop insertions : 30591600
% 1641.86/216.91
% 1641.86/216.91 # -------------------------------------------------
% 1641.86/216.91 # User time : 203.580 s
% 1641.86/216.91 # System time : 6.503 s
% 1641.86/216.91 # Total time : 210.083 s
% 1641.86/216.91 # Maximum resident set size: 1976 pages
% 1641.86/216.91
% 1641.86/216.91 # -------------------------------------------------
% 1641.86/216.91 # User time : 203.590 s
% 1641.86/216.91 # System time : 6.510 s
% 1641.86/216.91 # Total time : 210.100 s
% 1641.86/216.91 # Maximum resident set size: 1772 pages
% 1641.86/216.91 % E---3.1 exiting
% 1641.86/216.91 % E---3.1 exiting
%------------------------------------------------------------------------------