TSTP Solution File: SET096-7 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET096-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:06 EDT 2023
% Result : Unsatisfiable 0.15s 0.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 10 unt; 3 nHn; 19 RR)
% Number of literals : 38 ( 12 equ; 18 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.xGLVkvXv6k/E---3.1_957.p',subclass_members) ).
cnf(prove_two_subsets_of_singleton_1,negated_conjecture,
subclass(x,singleton(y)),
file('/export/starexec/sandbox/tmp/tmp.xGLVkvXv6k/E---3.1_957.p',prove_two_subsets_of_singleton_1) ).
cnf(null_class_is_unique,axiom,
( X1 = null_class
| member(not_subclass_element(X1,null_class),X1) ),
file('/export/starexec/sandbox/tmp/tmp.xGLVkvXv6k/E---3.1_957.p',null_class_is_unique) ).
cnf(prove_two_subsets_of_singleton_2,negated_conjecture,
x != null_class,
file('/export/starexec/sandbox/tmp/tmp.xGLVkvXv6k/E---3.1_957.p',prove_two_subsets_of_singleton_2) ).
cnf(property_of_singletons2,axiom,
( subclass(singleton(X1),X2)
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.xGLVkvXv6k/E---3.1_957.p',property_of_singletons2) ).
cnf(only_member_in_singleton,axiom,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
file('/export/starexec/sandbox/tmp/tmp.xGLVkvXv6k/E---3.1_957.p',only_member_in_singleton) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.xGLVkvXv6k/E---3.1_957.p',subclass_implies_equal) ).
cnf(prove_two_subsets_of_singleton_3,negated_conjecture,
singleton(y) != x,
file('/export/starexec/sandbox/tmp/tmp.xGLVkvXv6k/E---3.1_957.p',prove_two_subsets_of_singleton_3) ).
cnf(c_0_8,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_9,negated_conjecture,
subclass(x,singleton(y)),
prove_two_subsets_of_singleton_1 ).
cnf(c_0_10,negated_conjecture,
( member(X1,singleton(y))
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
( X1 = null_class
| member(not_subclass_element(X1,null_class),X1) ),
null_class_is_unique ).
cnf(c_0_12,negated_conjecture,
x != null_class,
prove_two_subsets_of_singleton_2 ).
cnf(c_0_13,axiom,
( subclass(singleton(X1),X2)
| ~ member(X1,X2) ),
property_of_singletons2 ).
cnf(c_0_14,axiom,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
only_member_in_singleton ).
cnf(c_0_15,negated_conjecture,
member(not_subclass_element(x,null_class),singleton(y)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_16,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_17,negated_conjecture,
singleton(y) != x,
prove_two_subsets_of_singleton_3 ).
cnf(c_0_18,plain,
( X1 = null_class
| subclass(singleton(not_subclass_element(X1,null_class)),X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_19,negated_conjecture,
not_subclass_element(x,null_class) = y,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
~ subclass(singleton(y),x),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_9]),c_0_17]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_12]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SET096-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n016.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 17:29:21 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 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.xGLVkvXv6k/E---3.1_957.p
% 0.15/0.46 # Version: 3.1pre001
% 0.15/0.46 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 # Starting sh5l with 300s (1) cores
% 0.15/0.46 # sh5l with pid 1074 completed with status 0
% 0.15/0.46 # Result found by sh5l
% 0.15/0.46 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 # Starting sh5l with 300s (1) cores
% 0.15/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.46 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.15/0.46 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.46 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.15/0.46 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 1077 completed with status 0
% 0.15/0.46 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 0.15/0.46 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 # Starting sh5l with 300s (1) cores
% 0.15/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.46 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.15/0.46 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.46 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.15/0.46 # Preprocessing time : 0.002 s
% 0.15/0.46 # Presaturation interreduction done
% 0.15/0.46
% 0.15/0.46 # Proof found!
% 0.15/0.46 # SZS status Unsatisfiable
% 0.15/0.46 # SZS output start CNFRefutation
% See solution above
% 0.15/0.46 # Parsed axioms : 142
% 0.15/0.46 # Removed by relevancy pruning/SinE : 9
% 0.15/0.46 # Initial clauses : 133
% 0.15/0.46 # Removed in clause preprocessing : 0
% 0.15/0.46 # Initial clauses in saturation : 133
% 0.15/0.46 # Processed clauses : 569
% 0.15/0.46 # ...of these trivial : 20
% 0.15/0.46 # ...subsumed : 120
% 0.15/0.46 # ...remaining for further processing : 429
% 0.15/0.46 # Other redundant clauses eliminated : 2
% 0.15/0.46 # Clauses deleted for lack of memory : 0
% 0.15/0.46 # Backward-subsumed : 9
% 0.15/0.46 # Backward-rewritten : 7
% 0.15/0.46 # Generated clauses : 1925
% 0.15/0.46 # ...of the previous two non-redundant : 1560
% 0.15/0.46 # ...aggressively subsumed : 0
% 0.15/0.46 # Contextual simplify-reflections : 3
% 0.15/0.46 # Paramodulations : 1907
% 0.15/0.46 # Factorizations : 5
% 0.15/0.46 # NegExts : 0
% 0.15/0.46 # Equation resolutions : 13
% 0.15/0.46 # Total rewrite steps : 430
% 0.15/0.46 # Propositional unsat checks : 0
% 0.15/0.46 # Propositional check models : 0
% 0.15/0.46 # Propositional check unsatisfiable : 0
% 0.15/0.46 # Propositional clauses : 0
% 0.15/0.46 # Propositional clauses after purity: 0
% 0.15/0.46 # Propositional unsat core size : 0
% 0.15/0.46 # Propositional preprocessing time : 0.000
% 0.15/0.46 # Propositional encoding time : 0.000
% 0.15/0.46 # Propositional solver time : 0.000
% 0.15/0.46 # Success case prop preproc time : 0.000
% 0.15/0.46 # Success case prop encoding time : 0.000
% 0.15/0.46 # Success case prop solver time : 0.000
% 0.15/0.46 # Current number of processed clauses : 282
% 0.15/0.46 # Positive orientable unit clauses : 78
% 0.15/0.46 # Positive unorientable unit clauses: 2
% 0.15/0.46 # Negative unit clauses : 6
% 0.15/0.46 # Non-unit-clauses : 196
% 0.15/0.46 # Current number of unprocessed clauses: 1240
% 0.15/0.46 # ...number of literals in the above : 3166
% 0.15/0.46 # Current number of archived formulas : 0
% 0.15/0.46 # Current number of archived clauses : 145
% 0.15/0.46 # Clause-clause subsumption calls (NU) : 7326
% 0.15/0.46 # Rec. Clause-clause subsumption calls : 6169
% 0.15/0.46 # Non-unit clause-clause subsumptions : 113
% 0.15/0.46 # Unit Clause-clause subsumption calls : 777
% 0.15/0.46 # Rewrite failures with RHS unbound : 0
% 0.15/0.46 # BW rewrite match attempts : 45
% 0.15/0.46 # BW rewrite match successes : 24
% 0.15/0.46 # Condensation attempts : 0
% 0.15/0.46 # Condensation successes : 0
% 0.15/0.46 # Termbank termtop insertions : 23986
% 0.15/0.46
% 0.15/0.46 # -------------------------------------------------
% 0.15/0.46 # User time : 0.040 s
% 0.15/0.46 # System time : 0.005 s
% 0.15/0.46 # Total time : 0.045 s
% 0.15/0.46 # Maximum resident set size: 2008 pages
% 0.15/0.46
% 0.15/0.46 # -------------------------------------------------
% 0.15/0.46 # User time : 0.043 s
% 0.15/0.46 # System time : 0.007 s
% 0.15/0.46 # Total time : 0.050 s
% 0.15/0.46 # Maximum resident set size: 1780 pages
% 0.15/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------