TSTP Solution File: SET510-6 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET510-6 : TPTP v8.1.2. 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:22:53 EDT 2023
% Result : Unsatisfiable 0.16s 0.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of clauses : 33 ( 12 unt; 11 nHn; 20 RR)
% Number of literals : 60 ( 24 equ; 21 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.nyVHVTrNpP/E---3.1_5068.p',unordered_pair_member) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/tmp/tmp.nyVHVTrNpP/E---3.1_5068.p',singleton_set) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox/tmp/tmp.nyVHVTrNpP/E---3.1_5068.p',regularity1) ).
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.nyVHVTrNpP/E---3.1_5068.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/tmp/tmp.nyVHVTrNpP/E---3.1_5068.p',class_elements_are_sets) ).
cnf(prove_corollary_to_singleton_is_null_class_1,negated_conjecture,
singleton(universal_class) != null_class,
file('/export/starexec/sandbox/tmp/tmp.nyVHVTrNpP/E---3.1_5068.p',prove_corollary_to_singleton_is_null_class_1) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.nyVHVTrNpP/E---3.1_5068.p',intersection3) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.nyVHVTrNpP/E---3.1_5068.p',complement1) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox/tmp/tmp.nyVHVTrNpP/E---3.1_5068.p',regularity2) ).
cnf(c_0_9,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_10,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_11,plain,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_13,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_14,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_15,plain,
( regular(singleton(X1)) = X1
| singleton(X1) = null_class ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( singleton(X1) = null_class
| member(X1,singleton(X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
singleton(universal_class) != null_class,
prove_corollary_to_singleton_is_null_class_1 ).
cnf(c_0_19,plain,
( singleton(X1) = null_class
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_21,negated_conjecture,
member(universal_class,universal_class),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_23,negated_conjecture,
( member(universal_class,intersection(X1,universal_class))
| ~ member(universal_class,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_25,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_12]) ).
cnf(c_0_26,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_27,negated_conjecture,
member(universal_class,intersection(singleton(universal_class),universal_class)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_17]),c_0_18]) ).
cnf(c_0_28,plain,
( intersection(singleton(X1),X1) = null_class
| singleton(X1) = null_class ),
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_29,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
member(universal_class,null_class),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_18]) ).
cnf(c_0_31,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_29]),c_0_16]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_30,c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SET510-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n006.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:20:55 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.nyVHVTrNpP/E---3.1_5068.p
% 0.16/0.47 # Version: 3.1pre001
% 0.16/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # sh5l with pid 5148 completed with status 0
% 0.16/0.47 # Result found by sh5l
% 0.16/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.47 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.16/0.47 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.16/0.47 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 5151 completed with status 0
% 0.16/0.47 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 0.16/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.47 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.16/0.47 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.16/0.47 # Preprocessing time : 0.002 s
% 0.16/0.47 # Presaturation interreduction done
% 0.16/0.47
% 0.16/0.47 # Proof found!
% 0.16/0.47 # SZS status Unsatisfiable
% 0.16/0.47 # SZS output start CNFRefutation
% See solution above
% 0.16/0.47 # Parsed axioms : 113
% 0.16/0.47 # Removed by relevancy pruning/SinE : 14
% 0.16/0.47 # Initial clauses : 99
% 0.16/0.47 # Removed in clause preprocessing : 0
% 0.16/0.47 # Initial clauses in saturation : 99
% 0.16/0.47 # Processed clauses : 289
% 0.16/0.47 # ...of these trivial : 5
% 0.16/0.47 # ...subsumed : 10
% 0.16/0.47 # ...remaining for further processing : 274
% 0.16/0.47 # Other redundant clauses eliminated : 4
% 0.16/0.47 # Clauses deleted for lack of memory : 0
% 0.16/0.47 # Backward-subsumed : 0
% 0.16/0.47 # Backward-rewritten : 2
% 0.16/0.47 # Generated clauses : 631
% 0.16/0.47 # ...of the previous two non-redundant : 555
% 0.16/0.47 # ...aggressively subsumed : 0
% 0.16/0.47 # Contextual simplify-reflections : 1
% 0.16/0.47 # Paramodulations : 622
% 0.16/0.47 # Factorizations : 2
% 0.16/0.47 # NegExts : 0
% 0.16/0.47 # Equation resolutions : 6
% 0.16/0.47 # Total rewrite steps : 138
% 0.16/0.47 # Propositional unsat checks : 0
% 0.16/0.47 # Propositional check models : 0
% 0.16/0.47 # Propositional check unsatisfiable : 0
% 0.16/0.47 # Propositional clauses : 0
% 0.16/0.47 # Propositional clauses after purity: 0
% 0.16/0.47 # Propositional unsat core size : 0
% 0.16/0.47 # Propositional preprocessing time : 0.000
% 0.16/0.47 # Propositional encoding time : 0.000
% 0.16/0.47 # Propositional solver time : 0.000
% 0.16/0.47 # Success case prop preproc time : 0.000
% 0.16/0.47 # Success case prop encoding time : 0.000
% 0.16/0.47 # Success case prop solver time : 0.000
% 0.16/0.47 # Current number of processed clauses : 171
% 0.16/0.47 # Positive orientable unit clauses : 64
% 0.16/0.47 # Positive unorientable unit clauses: 2
% 0.16/0.47 # Negative unit clauses : 2
% 0.16/0.47 # Non-unit-clauses : 103
% 0.16/0.47 # Current number of unprocessed clauses: 463
% 0.16/0.47 # ...number of literals in the above : 949
% 0.16/0.47 # Current number of archived formulas : 0
% 0.16/0.47 # Current number of archived clauses : 101
% 0.16/0.47 # Clause-clause subsumption calls (NU) : 2605
% 0.16/0.47 # Rec. Clause-clause subsumption calls : 2291
% 0.16/0.47 # Non-unit clause-clause subsumptions : 11
% 0.16/0.47 # Unit Clause-clause subsumption calls : 412
% 0.16/0.47 # Rewrite failures with RHS unbound : 0
% 0.16/0.47 # BW rewrite match attempts : 28
% 0.16/0.47 # BW rewrite match successes : 6
% 0.16/0.47 # Condensation attempts : 0
% 0.16/0.47 # Condensation successes : 0
% 0.16/0.47 # Termbank termtop insertions : 11114
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.017 s
% 0.16/0.47 # System time : 0.005 s
% 0.16/0.47 # Total time : 0.022 s
% 0.16/0.47 # Maximum resident set size: 1948 pages
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.020 s
% 0.16/0.47 # System time : 0.008 s
% 0.16/0.47 # Total time : 0.028 s
% 0.16/0.47 # Maximum resident set size: 1772 pages
% 0.16/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------