TSTP Solution File: SET468-6 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET468-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:49 EDT 2023
% Result : Unsatisfiable 99.69s 13.36s
% Output : CNFRefutation 99.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 30 ( 12 unt; 8 nHn; 19 RR)
% Number of literals : 51 ( 14 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 47 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.fTalrUWNKR/E---3.1_11824.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/tmp/tmp.fTalrUWNKR/E---3.1_11824.p',class_elements_are_sets) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.fTalrUWNKR/E---3.1_11824.p',complement1) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox/tmp/tmp.fTalrUWNKR/E---3.1_11824.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.fTalrUWNKR/E---3.1_11824.p',cartesian_product4) ).
cnf(cartesian_product1,axiom,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox/tmp/tmp.fTalrUWNKR/E---3.1_11824.p',cartesian_product1) ).
cnf(prove_sets_with_one_member2_2,negated_conjecture,
~ subclass(cross_product(x,x),identity_relation),
file('/export/starexec/sandbox/tmp/tmp.fTalrUWNKR/E---3.1_11824.p',prove_sets_with_one_member2_2) ).
cnf(prove_sets_with_one_member2_1,negated_conjecture,
x = null_class,
file('/export/starexec/sandbox/tmp/tmp.fTalrUWNKR/E---3.1_11824.p',prove_sets_with_one_member2_1) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.fTalrUWNKR/E---3.1_11824.p',not_subclass_members1) ).
cnf(c_0_9,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_10,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_11,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_12,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_13,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
cartesian_product4 ).
cnf(c_0_15,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_17,axiom,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
cartesian_product1 ).
cnf(c_0_18,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_14,c_0_12]) ).
cnf(c_0_19,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( cross_product(X1,X2) = null_class
| member(first(regular(cross_product(X1,X2))),X3)
| ~ member(regular(cross_product(X1,X2)),cross_product(X3,X4)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
~ subclass(cross_product(x,x),identity_relation),
prove_sets_with_one_member2_2 ).
cnf(c_0_22,negated_conjecture,
x = null_class,
prove_sets_with_one_member2_1 ).
cnf(c_0_23,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_19]),c_0_13]) ).
cnf(c_0_24,plain,
( cross_product(X1,X2) = null_class
| member(first(regular(cross_product(X1,X2))),X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_25,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_26,negated_conjecture,
~ subclass(cross_product(null_class,null_class),identity_relation),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22]) ).
cnf(c_0_27,plain,
cross_product(null_class,X1) = null_class,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
subclass(null_class,X1),
inference(spm,[status(thm)],[c_0_23,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : SET468-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n015.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon Oct 2 17:38:31 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.16/0.44 Running first-order model finding
% 0.16/0.44 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.fTalrUWNKR/E---3.1_11824.p
% 99.69/13.36 # Version: 3.1pre001
% 99.69/13.36 # Preprocessing class: FSLSSMSMSSSNFFN.
% 99.69/13.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 99.69/13.36 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 99.69/13.36 # Starting new_bool_3 with 300s (1) cores
% 99.69/13.36 # Starting new_bool_1 with 300s (1) cores
% 99.69/13.36 # Starting sh5l with 300s (1) cores
% 99.69/13.36 # sh5l with pid 11905 completed with status 0
% 99.69/13.36 # Result found by sh5l
% 99.69/13.36 # Preprocessing class: FSLSSMSMSSSNFFN.
% 99.69/13.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 99.69/13.36 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 99.69/13.36 # Starting new_bool_3 with 300s (1) cores
% 99.69/13.36 # Starting new_bool_1 with 300s (1) cores
% 99.69/13.36 # Starting sh5l with 300s (1) cores
% 99.69/13.36 # SinE strategy is gf500_gu_R04_F100_L20000
% 99.69/13.36 # Search class: FGHSM-FFMM31-MFFFFFNN
% 99.69/13.36 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 99.69/13.36 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 99.69/13.36 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 11908 completed with status 0
% 99.69/13.36 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 99.69/13.36 # Preprocessing class: FSLSSMSMSSSNFFN.
% 99.69/13.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 99.69/13.36 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 99.69/13.36 # Starting new_bool_3 with 300s (1) cores
% 99.69/13.36 # Starting new_bool_1 with 300s (1) cores
% 99.69/13.36 # Starting sh5l with 300s (1) cores
% 99.69/13.36 # SinE strategy is gf500_gu_R04_F100_L20000
% 99.69/13.36 # Search class: FGHSM-FFMM31-MFFFFFNN
% 99.69/13.36 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 99.69/13.36 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 99.69/13.36 # Preprocessing time : 0.003 s
% 99.69/13.36 # Presaturation interreduction done
% 99.69/13.36
% 99.69/13.36 # Proof found!
% 99.69/13.36 # SZS status Unsatisfiable
% 99.69/13.36 # SZS output start CNFRefutation
% See solution above
% 99.69/13.37 # Parsed axioms : 114
% 99.69/13.37 # Removed by relevancy pruning/SinE : 14
% 99.69/13.37 # Initial clauses : 100
% 99.69/13.37 # Removed in clause preprocessing : 0
% 99.69/13.37 # Initial clauses in saturation : 100
% 99.69/13.37 # Processed clauses : 31659
% 99.69/13.37 # ...of these trivial : 1419
% 99.69/13.37 # ...subsumed : 22778
% 99.69/13.37 # ...remaining for further processing : 7462
% 99.69/13.37 # Other redundant clauses eliminated : 16
% 99.69/13.37 # Clauses deleted for lack of memory : 0
% 99.69/13.37 # Backward-subsumed : 229
% 99.69/13.37 # Backward-rewritten : 1109
% 99.69/13.37 # Generated clauses : 921228
% 99.69/13.37 # ...of the previous two non-redundant : 780604
% 99.69/13.37 # ...aggressively subsumed : 0
% 99.69/13.37 # Contextual simplify-reflections : 19
% 99.69/13.37 # Paramodulations : 921170
% 99.69/13.37 # Factorizations : 27
% 99.69/13.37 # NegExts : 0
% 99.69/13.37 # Equation resolutions : 27
% 99.69/13.37 # Total rewrite steps : 305453
% 99.69/13.37 # Propositional unsat checks : 0
% 99.69/13.37 # Propositional check models : 0
% 99.69/13.37 # Propositional check unsatisfiable : 0
% 99.69/13.37 # Propositional clauses : 0
% 99.69/13.37 # Propositional clauses after purity: 0
% 99.69/13.37 # Propositional unsat core size : 0
% 99.69/13.37 # Propositional preprocessing time : 0.000
% 99.69/13.37 # Propositional encoding time : 0.000
% 99.69/13.37 # Propositional solver time : 0.000
% 99.69/13.37 # Success case prop preproc time : 0.000
% 99.69/13.37 # Success case prop encoding time : 0.000
% 99.69/13.37 # Success case prop solver time : 0.000
% 99.69/13.37 # Current number of processed clauses : 6019
% 99.69/13.37 # Positive orientable unit clauses : 2274
% 99.69/13.37 # Positive unorientable unit clauses: 10
% 99.69/13.37 # Negative unit clauses : 12
% 99.69/13.37 # Non-unit-clauses : 3723
% 99.69/13.37 # Current number of unprocessed clauses: 742807
% 99.69/13.37 # ...number of literals in the above : 1555452
% 99.69/13.37 # Current number of archived formulas : 0
% 99.69/13.37 # Current number of archived clauses : 1441
% 99.69/13.37 # Clause-clause subsumption calls (NU) : 2688259
% 99.69/13.37 # Rec. Clause-clause subsumption calls : 1531830
% 99.69/13.37 # Non-unit clause-clause subsumptions : 17964
% 99.69/13.37 # Unit Clause-clause subsumption calls : 403288
% 99.69/13.37 # Rewrite failures with RHS unbound : 90
% 99.69/13.37 # BW rewrite match attempts : 17787
% 99.69/13.37 # BW rewrite match successes : 476
% 99.69/13.37 # Condensation attempts : 0
% 99.69/13.37 # Condensation successes : 0
% 99.69/13.37 # Termbank termtop insertions : 16431602
% 99.69/13.37
% 99.69/13.37 # -------------------------------------------------
% 99.69/13.37 # User time : 12.336 s
% 99.69/13.37 # System time : 0.477 s
% 99.69/13.37 # Total time : 12.814 s
% 99.69/13.37 # Maximum resident set size: 1956 pages
% 99.69/13.37
% 99.69/13.37 # -------------------------------------------------
% 99.69/13.37 # User time : 12.338 s
% 99.69/13.37 # System time : 0.480 s
% 99.69/13.37 # Total time : 12.818 s
% 99.69/13.37 # Maximum resident set size: 1772 pages
% 99.69/13.37 % E---3.1 exiting
%------------------------------------------------------------------------------