TSTP Solution File: SET205-6 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET205-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:28 EDT 2023
% Result : Unsatisfiable 37.79s 5.25s
% Output : CNFRefutation 37.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 40 ( 16 unt; 7 nHn; 24 RR)
% Number of literals : 67 ( 29 equ; 28 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 3 con; 0-3 aty)
% Number of variables : 77 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.R1s5keShLP/E---3.1_26699.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/tmp/tmp.R1s5keShLP/E---3.1_26699.p',class_elements_are_sets) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.R1s5keShLP/E---3.1_26699.p',intersection2) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox/tmp/tmp.R1s5keShLP/E---3.1_26699.p',regularity1) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.R1s5keShLP/E---3.1_26699.p',complement1) ).
cnf(domain1,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.R1s5keShLP/E---3.1_26699.p',domain1) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox/tmp/tmp.R1s5keShLP/E---3.1_26699.p',restriction1) ).
cnf(restriction2,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
file('/export/starexec/sandbox/tmp/tmp.R1s5keShLP/E---3.1_26699.p',restriction2) ).
cnf(cartesian_product4,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.R1s5keShLP/E---3.1_26699.p',cartesian_product4) ).
cnf(cartesian_product2,axiom,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox/tmp/tmp.R1s5keShLP/E---3.1_26699.p',cartesian_product2) ).
cnf(prove_cross_product_with_null_class1_1,negated_conjecture,
cross_product(x,null_class) != null_class,
file('/export/starexec/sandbox/tmp/tmp.R1s5keShLP/E---3.1_26699.p',prove_cross_product_with_null_class1_1) ).
cnf(c_0_11,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_12,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_13,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_14,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_15,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_16,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_19,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_20,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
domain1 ).
cnf(c_0_21,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_22,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_23,plain,
( intersection(X1,complement(X2)) = null_class
| ~ member(regular(intersection(X1,complement(X2))),X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_24,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( intersection(X1,cross_product(singleton(X2),universal_class)) != null_class
| ~ member(X2,domain_of(X1)) ),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
intersection(X1,cross_product(X2,X3)) = intersection(cross_product(X2,X3),X1),
inference(rw,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_27,plain,
intersection(X1,null_class) = null_class,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_19]),c_0_24]) ).
cnf(c_0_28,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
cartesian_product4 ).
cnf(c_0_29,plain,
( domain_of(X1) = null_class
| intersection(X1,cross_product(singleton(regular(domain_of(X1))),universal_class)) != null_class ),
inference(spm,[status(thm)],[c_0_25,c_0_14]) ).
cnf(c_0_30,plain,
intersection(null_class,cross_product(X1,X2)) = null_class,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,axiom,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
cartesian_product2 ).
cnf(c_0_32,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_28,c_0_14]) ).
cnf(c_0_33,plain,
domain_of(null_class) = null_class,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,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_31,c_0_32]) ).
cnf(c_0_35,plain,
~ member(X1,null_class),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_33]),c_0_30])]) ).
cnf(c_0_36,plain,
( cross_product(X1,X2) = null_class
| member(second(regular(cross_product(X1,X2))),X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_14]) ).
cnf(c_0_37,negated_conjecture,
cross_product(x,null_class) != null_class,
prove_cross_product_with_null_class1_1 ).
cnf(c_0_38,plain,
cross_product(X1,null_class) = null_class,
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SET205-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 2400
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon Oct 2 16:53:19 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 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.R1s5keShLP/E---3.1_26699.p
% 37.79/5.25 # Version: 3.1pre001
% 37.79/5.25 # Preprocessing class: FSLSSMSMSSSNFFN.
% 37.79/5.25 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 37.79/5.25 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 37.79/5.25 # Starting new_bool_3 with 300s (1) cores
% 37.79/5.25 # Starting new_bool_1 with 300s (1) cores
% 37.79/5.25 # Starting sh5l with 300s (1) cores
% 37.79/5.25 # sh5l with pid 26818 completed with status 0
% 37.79/5.25 # Result found by sh5l
% 37.79/5.25 # Preprocessing class: FSLSSMSMSSSNFFN.
% 37.79/5.25 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 37.79/5.25 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 37.79/5.25 # Starting new_bool_3 with 300s (1) cores
% 37.79/5.25 # Starting new_bool_1 with 300s (1) cores
% 37.79/5.25 # Starting sh5l with 300s (1) cores
% 37.79/5.25 # SinE strategy is gf500_gu_R04_F100_L20000
% 37.79/5.25 # Search class: FGHSM-FFMM31-MFFFFFNN
% 37.79/5.25 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 37.79/5.25 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 37.79/5.25 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 26822 completed with status 0
% 37.79/5.25 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 37.79/5.25 # Preprocessing class: FSLSSMSMSSSNFFN.
% 37.79/5.25 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 37.79/5.25 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 37.79/5.25 # Starting new_bool_3 with 300s (1) cores
% 37.79/5.25 # Starting new_bool_1 with 300s (1) cores
% 37.79/5.25 # Starting sh5l with 300s (1) cores
% 37.79/5.25 # SinE strategy is gf500_gu_R04_F100_L20000
% 37.79/5.25 # Search class: FGHSM-FFMM31-MFFFFFNN
% 37.79/5.25 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 37.79/5.25 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 37.79/5.25 # Preprocessing time : 0.003 s
% 37.79/5.25 # Presaturation interreduction done
% 37.79/5.25
% 37.79/5.25 # Proof found!
% 37.79/5.25 # SZS status Unsatisfiable
% 37.79/5.25 # SZS output start CNFRefutation
% See solution above
% 37.79/5.25 # Parsed axioms : 113
% 37.79/5.25 # Removed by relevancy pruning/SinE : 14
% 37.79/5.25 # Initial clauses : 99
% 37.79/5.25 # Removed in clause preprocessing : 0
% 37.79/5.25 # Initial clauses in saturation : 99
% 37.79/5.25 # Processed clauses : 12788
% 37.79/5.25 # ...of these trivial : 742
% 37.79/5.25 # ...subsumed : 7560
% 37.79/5.25 # ...remaining for further processing : 4486
% 37.79/5.25 # Other redundant clauses eliminated : 16
% 37.79/5.25 # Clauses deleted for lack of memory : 0
% 37.79/5.25 # Backward-subsumed : 188
% 37.79/5.25 # Backward-rewritten : 718
% 37.79/5.25 # Generated clauses : 403805
% 37.79/5.25 # ...of the previous two non-redundant : 330312
% 37.79/5.25 # ...aggressively subsumed : 0
% 37.79/5.25 # Contextual simplify-reflections : 7
% 37.79/5.25 # Paramodulations : 403758
% 37.79/5.25 # Factorizations : 22
% 37.79/5.25 # NegExts : 0
% 37.79/5.25 # Equation resolutions : 25
% 37.79/5.25 # Total rewrite steps : 163277
% 37.79/5.25 # Propositional unsat checks : 0
% 37.79/5.25 # Propositional check models : 0
% 37.79/5.25 # Propositional check unsatisfiable : 0
% 37.79/5.25 # Propositional clauses : 0
% 37.79/5.25 # Propositional clauses after purity: 0
% 37.79/5.25 # Propositional unsat core size : 0
% 37.79/5.25 # Propositional preprocessing time : 0.000
% 37.79/5.25 # Propositional encoding time : 0.000
% 37.79/5.25 # Propositional solver time : 0.000
% 37.79/5.25 # Success case prop preproc time : 0.000
% 37.79/5.25 # Success case prop encoding time : 0.000
% 37.79/5.25 # Success case prop solver time : 0.000
% 37.79/5.25 # Current number of processed clauses : 3480
% 37.79/5.25 # Positive orientable unit clauses : 1460
% 37.79/5.25 # Positive unorientable unit clauses: 11
% 37.79/5.25 # Negative unit clauses : 13
% 37.79/5.25 # Non-unit-clauses : 1996
% 37.79/5.25 # Current number of unprocessed clauses: 316160
% 37.79/5.25 # ...number of literals in the above : 625736
% 37.79/5.25 # Current number of archived formulas : 0
% 37.79/5.25 # Current number of archived clauses : 1004
% 37.79/5.25 # Clause-clause subsumption calls (NU) : 707845
% 37.79/5.25 # Rec. Clause-clause subsumption calls : 476544
% 37.79/5.25 # Non-unit clause-clause subsumptions : 5560
% 37.79/5.25 # Unit Clause-clause subsumption calls : 189844
% 37.79/5.25 # Rewrite failures with RHS unbound : 145
% 37.79/5.25 # BW rewrite match attempts : 6506
% 37.79/5.25 # BW rewrite match successes : 207
% 37.79/5.25 # Condensation attempts : 0
% 37.79/5.25 # Condensation successes : 0
% 37.79/5.25 # Termbank termtop insertions : 6787449
% 37.79/5.25
% 37.79/5.25 # -------------------------------------------------
% 37.79/5.25 # User time : 4.598 s
% 37.79/5.25 # System time : 0.208 s
% 37.79/5.25 # Total time : 4.806 s
% 37.79/5.25 # Maximum resident set size: 1948 pages
% 37.79/5.25
% 37.79/5.25 # -------------------------------------------------
% 37.79/5.25 # User time : 4.600 s
% 37.79/5.25 # System time : 0.209 s
% 37.79/5.25 # Total time : 4.810 s
% 37.79/5.25 # Maximum resident set size: 1772 pages
% 37.79/5.25 % E---3.1 exiting
%------------------------------------------------------------------------------