TSTP Solution File: SET468-6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET468-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : Tue May 21 02:54:07 EDT 2024
% Result : Unsatisfiable 67.09s 8.96s
% Output : CNFRefutation 67.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 35 ( 13 unt; 8 nHn; 24 RR)
% Number of literals : 61 ( 15 equ; 26 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 : 59 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(cartesian_product4,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product4) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(cartesian_product1,axiom,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product1) ).
cnf(prove_sets_with_one_member2_2,negated_conjecture,
~ subclass(cross_product(x,x),identity_relation),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_sets_with_one_member2_2) ).
cnf(prove_sets_with_one_member2_1,negated_conjecture,
x = null_class,
file('/export/starexec/sandbox/benchmark/theBenchmark.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/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(c_0_9,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_10,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_11,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
c_0_9 ).
cnf(c_0_12,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_13,plain,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
inference(fof_simplification,[status(thm)],[cartesian_product4]) ).
cnf(c_0_14,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
c_0_10 ).
cnf(c_0_15,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
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,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
inference(fof_simplification,[status(thm)],[cartesian_product1]) ).
cnf(c_0_18,plain,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
c_0_13 ).
cnf(c_0_19,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_21,plain,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
c_0_17 ).
cnf(c_0_22,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_18,c_0_15]) ).
cnf(c_0_23,negated_conjecture,
~ subclass(cross_product(x,x),identity_relation),
inference(fof_simplification,[status(thm)],[prove_sets_with_one_member2_2]) ).
cnf(c_0_24,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,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_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
~ subclass(cross_product(x,x),identity_relation),
c_0_23 ).
cnf(c_0_27,negated_conjecture,
x = null_class,
prove_sets_with_one_member2_1 ).
cnf(c_0_28,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_24]),c_0_16]) ).
cnf(c_0_29,plain,
( cross_product(X1,X2) = null_class
| member(first(regular(cross_product(X1,X2))),X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_15]) ).
cnf(c_0_30,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_31,negated_conjecture,
~ subclass(cross_product(null_class,null_class),identity_relation),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_27]) ).
cnf(c_0_32,plain,
cross_product(null_class,X1) = null_class,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
subclass(null_class,X1),
inference(spm,[status(thm)],[c_0_28,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.12 % Problem : SET468-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n006.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 : Mon May 20 12:41:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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/benchmark/theBenchmark.p
% 67.09/8.96 # Version: 3.1.0
% 67.09/8.96 # Preprocessing class: FSLSSMSMSSSNFFN.
% 67.09/8.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 67.09/8.96 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 67.09/8.96 # Starting new_bool_3 with 300s (1) cores
% 67.09/8.96 # Starting new_bool_1 with 300s (1) cores
% 67.09/8.96 # Starting sh5l with 300s (1) cores
% 67.09/8.96 # sh5l with pid 17913 completed with status 0
% 67.09/8.96 # Result found by sh5l
% 67.09/8.96 # Preprocessing class: FSLSSMSMSSSNFFN.
% 67.09/8.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 67.09/8.96 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 67.09/8.96 # Starting new_bool_3 with 300s (1) cores
% 67.09/8.96 # Starting new_bool_1 with 300s (1) cores
% 67.09/8.96 # Starting sh5l with 300s (1) cores
% 67.09/8.96 # SinE strategy is gf500_gu_R04_F100_L20000
% 67.09/8.96 # Search class: FGHSM-FFMM31-MFFFFFNN
% 67.09/8.96 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 67.09/8.96 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 67.09/8.96 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 17917 completed with status 0
% 67.09/8.96 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 67.09/8.96 # Preprocessing class: FSLSSMSMSSSNFFN.
% 67.09/8.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 67.09/8.96 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 67.09/8.96 # Starting new_bool_3 with 300s (1) cores
% 67.09/8.96 # Starting new_bool_1 with 300s (1) cores
% 67.09/8.96 # Starting sh5l with 300s (1) cores
% 67.09/8.96 # SinE strategy is gf500_gu_R04_F100_L20000
% 67.09/8.96 # Search class: FGHSM-FFMM31-MFFFFFNN
% 67.09/8.96 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 67.09/8.96 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 67.09/8.96 # Preprocessing time : 0.003 s
% 67.09/8.96 # Presaturation interreduction done
% 67.09/8.96
% 67.09/8.96 # Proof found!
% 67.09/8.96 # SZS status Unsatisfiable
% 67.09/8.96 # SZS output start CNFRefutation
% See solution above
% 67.09/8.96 # Parsed axioms : 114
% 67.09/8.96 # Removed by relevancy pruning/SinE : 14
% 67.09/8.96 # Initial clauses : 100
% 67.09/8.96 # Removed in clause preprocessing : 0
% 67.09/8.96 # Initial clauses in saturation : 100
% 67.09/8.96 # Processed clauses : 31659
% 67.09/8.96 # ...of these trivial : 1419
% 67.09/8.96 # ...subsumed : 22778
% 67.09/8.96 # ...remaining for further processing : 7462
% 67.09/8.96 # Other redundant clauses eliminated : 16
% 67.09/8.96 # Clauses deleted for lack of memory : 0
% 67.09/8.96 # Backward-subsumed : 229
% 67.09/8.96 # Backward-rewritten : 1109
% 67.09/8.96 # Generated clauses : 921228
% 67.09/8.96 # ...of the previous two non-redundant : 780604
% 67.09/8.96 # ...aggressively subsumed : 0
% 67.09/8.96 # Contextual simplify-reflections : 19
% 67.09/8.96 # Paramodulations : 921170
% 67.09/8.96 # Factorizations : 27
% 67.09/8.96 # NegExts : 0
% 67.09/8.96 # Equation resolutions : 27
% 67.09/8.96 # Disequality decompositions : 0
% 67.09/8.96 # Total rewrite steps : 305453
% 67.09/8.96 # ...of those cached : 292701
% 67.09/8.96 # Propositional unsat checks : 0
% 67.09/8.96 # Propositional check models : 0
% 67.09/8.96 # Propositional check unsatisfiable : 0
% 67.09/8.96 # Propositional clauses : 0
% 67.09/8.96 # Propositional clauses after purity: 0
% 67.09/8.96 # Propositional unsat core size : 0
% 67.09/8.96 # Propositional preprocessing time : 0.000
% 67.09/8.96 # Propositional encoding time : 0.000
% 67.09/8.96 # Propositional solver time : 0.000
% 67.09/8.96 # Success case prop preproc time : 0.000
% 67.09/8.96 # Success case prop encoding time : 0.000
% 67.09/8.96 # Success case prop solver time : 0.000
% 67.09/8.96 # Current number of processed clauses : 6019
% 67.09/8.96 # Positive orientable unit clauses : 2274
% 67.09/8.96 # Positive unorientable unit clauses: 10
% 67.09/8.96 # Negative unit clauses : 12
% 67.09/8.96 # Non-unit-clauses : 3723
% 67.09/8.96 # Current number of unprocessed clauses: 742807
% 67.09/8.96 # ...number of literals in the above : 1555452
% 67.09/8.96 # Current number of archived formulas : 0
% 67.09/8.96 # Current number of archived clauses : 1441
% 67.09/8.96 # Clause-clause subsumption calls (NU) : 2688248
% 67.09/8.96 # Rec. Clause-clause subsumption calls : 1531829
% 67.09/8.96 # Non-unit clause-clause subsumptions : 17964
% 67.09/8.96 # Unit Clause-clause subsumption calls : 403288
% 67.09/8.96 # Rewrite failures with RHS unbound : 90
% 67.09/8.96 # BW rewrite match attempts : 17787
% 67.09/8.96 # BW rewrite match successes : 476
% 67.09/8.96 # Condensation attempts : 0
% 67.09/8.96 # Condensation successes : 0
% 67.09/8.96 # Termbank termtop insertions : 16432051
% 67.09/8.96 # Search garbage collected termcells : 229
% 67.09/8.96
% 67.09/8.96 # -------------------------------------------------
% 67.09/8.96 # User time : 7.958 s
% 67.09/8.96 # System time : 0.355 s
% 67.09/8.96 # Total time : 8.313 s
% 67.09/8.96 # Maximum resident set size: 1888 pages
% 67.09/8.96
% 67.09/8.96 # -------------------------------------------------
% 67.09/8.96 # User time : 7.961 s
% 67.09/8.96 # System time : 0.357 s
% 67.09/8.96 # Total time : 8.319 s
% 67.09/8.96 # Maximum resident set size: 1796 pages
% 67.09/8.96 % E---3.1 exiting
% 67.09/8.96 % E exiting
%------------------------------------------------------------------------------