TSTP Solution File: SET146-6 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET146-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:39 EDT 2023
% Result : Unsatisfiable 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of clauses : 36 ( 16 unt; 5 nHn; 21 RR)
% Number of literals : 58 ( 24 equ; 25 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 : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 63 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.VE4iJwhdWn/E---3.1_9054.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.VE4iJwhdWn/E---3.1_9054.p',class_elements_are_sets) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.VE4iJwhdWn/E---3.1_9054.p',intersection2) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.VE4iJwhdWn/E---3.1_9054.p',regularity1) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.VE4iJwhdWn/E---3.1_9054.p',complement1) ).
cnf(domain1,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.VE4iJwhdWn/E---3.1_9054.p',domain1) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox2/tmp/tmp.VE4iJwhdWn/E---3.1_9054.p',restriction1) ).
cnf(restriction2,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.VE4iJwhdWn/E---3.1_9054.p',restriction2) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.VE4iJwhdWn/E---3.1_9054.p',intersection1) ).
cnf(prove_intersection_with_null_class_1,negated_conjecture,
intersection(null_class,x) != null_class,
file('/export/starexec/sandbox2/tmp/tmp.VE4iJwhdWn/E---3.1_9054.p',prove_intersection_with_null_class_1) ).
cnf(c_0_10,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_11,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_12,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_13,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_14,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_15,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_18,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_19,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
domain1 ).
cnf(c_0_20,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_21,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_22,plain,
( intersection(X1,complement(X2)) = null_class
| ~ member(regular(intersection(X1,complement(X2))),X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_23,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( intersection(X1,cross_product(singleton(X2),universal_class)) != null_class
| ~ member(X2,domain_of(X1)) ),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
intersection(X1,cross_product(X2,X3)) = intersection(cross_product(X2,X3),X1),
inference(rw,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_26,plain,
intersection(X1,null_class) = null_class,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_18]),c_0_23]) ).
cnf(c_0_27,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_24,c_0_13]) ).
cnf(c_0_28,plain,
intersection(null_class,cross_product(X1,X2)) = null_class,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
domain_of(null_class) = null_class,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_31,plain,
~ member(X1,null_class),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_29]),c_0_28])]) ).
cnf(c_0_32,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_13]) ).
cnf(c_0_33,negated_conjecture,
intersection(null_class,x) != null_class,
prove_intersection_with_null_class_1 ).
cnf(c_0_34,plain,
intersection(null_class,X1) = null_class,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : SET146-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n010.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 16:56:50 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.VE4iJwhdWn/E---3.1_9054.p
% 0.15/0.45 # Version: 3.1pre001
% 0.15/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # Starting sh5l with 300s (1) cores
% 0.15/0.45 # sh5l with pid 9136 completed with status 0
% 0.15/0.45 # Result found by sh5l
% 0.15/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # Starting sh5l with 300s (1) cores
% 0.15/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.45 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.15/0.45 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.15/0.45 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 9139 completed with status 0
% 0.15/0.45 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 0.15/0.45 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # Starting sh5l with 300s (1) cores
% 0.15/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.45 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.15/0.45 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.15/0.45 # Preprocessing time : 0.002 s
% 0.15/0.45 # Presaturation interreduction done
% 0.15/0.45
% 0.15/0.45 # Proof found!
% 0.15/0.45 # SZS status Unsatisfiable
% 0.15/0.45 # SZS output start CNFRefutation
% See solution above
% 0.15/0.45 # Parsed axioms : 113
% 0.15/0.45 # Removed by relevancy pruning/SinE : 14
% 0.15/0.45 # Initial clauses : 99
% 0.15/0.45 # Removed in clause preprocessing : 0
% 0.15/0.45 # Initial clauses in saturation : 99
% 0.15/0.45 # Processed clauses : 271
% 0.15/0.45 # ...of these trivial : 4
% 0.15/0.45 # ...subsumed : 6
% 0.15/0.45 # ...remaining for further processing : 261
% 0.15/0.45 # Other redundant clauses eliminated : 2
% 0.15/0.45 # Clauses deleted for lack of memory : 0
% 0.15/0.45 # Backward-subsumed : 7
% 0.15/0.45 # Backward-rewritten : 6
% 0.15/0.45 # Generated clauses : 541
% 0.15/0.45 # ...of the previous two non-redundant : 499
% 0.15/0.45 # ...aggressively subsumed : 0
% 0.15/0.45 # Contextual simplify-reflections : 0
% 0.15/0.45 # Paramodulations : 537
% 0.15/0.45 # Factorizations : 0
% 0.15/0.45 # NegExts : 0
% 0.15/0.45 # Equation resolutions : 4
% 0.15/0.45 # Total rewrite steps : 81
% 0.15/0.45 # Propositional unsat checks : 0
% 0.15/0.45 # Propositional check models : 0
% 0.15/0.45 # Propositional check unsatisfiable : 0
% 0.15/0.45 # Propositional clauses : 0
% 0.15/0.45 # Propositional clauses after purity: 0
% 0.15/0.45 # Propositional unsat core size : 0
% 0.15/0.45 # Propositional preprocessing time : 0.000
% 0.15/0.45 # Propositional encoding time : 0.000
% 0.15/0.45 # Propositional solver time : 0.000
% 0.15/0.45 # Success case prop preproc time : 0.000
% 0.15/0.45 # Success case prop encoding time : 0.000
% 0.15/0.45 # Success case prop solver time : 0.000
% 0.15/0.45 # Current number of processed clauses : 148
% 0.15/0.45 # Positive orientable unit clauses : 54
% 0.15/0.45 # Positive unorientable unit clauses: 1
% 0.15/0.45 # Negative unit clauses : 1
% 0.15/0.45 # Non-unit-clauses : 92
% 0.15/0.45 # Current number of unprocessed clauses: 425
% 0.15/0.45 # ...number of literals in the above : 912
% 0.15/0.45 # Current number of archived formulas : 0
% 0.15/0.45 # Current number of archived clauses : 111
% 0.15/0.45 # Clause-clause subsumption calls (NU) : 2653
% 0.15/0.45 # Rec. Clause-clause subsumption calls : 2322
% 0.15/0.45 # Non-unit clause-clause subsumptions : 8
% 0.15/0.45 # Unit Clause-clause subsumption calls : 614
% 0.15/0.45 # Rewrite failures with RHS unbound : 0
% 0.15/0.45 # BW rewrite match attempts : 29
% 0.15/0.45 # BW rewrite match successes : 10
% 0.15/0.45 # Condensation attempts : 0
% 0.15/0.45 # Condensation successes : 0
% 0.15/0.45 # Termbank termtop insertions : 10357
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.020 s
% 0.15/0.45 # System time : 0.001 s
% 0.15/0.45 # Total time : 0.022 s
% 0.15/0.45 # Maximum resident set size: 1948 pages
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.023 s
% 0.15/0.45 # System time : 0.003 s
% 0.15/0.45 # Total time : 0.026 s
% 0.15/0.45 # Maximum resident set size: 1772 pages
% 0.15/0.45 % E---3.1 exiting
% 0.15/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------