TSTP Solution File: SET090-7 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET090-7 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:57:31 EDT 2024
% Result : Unsatisfiable 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 6 unt; 0 nHn; 17 RR)
% Number of literals : 29 ( 11 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(only_member_in_singleton,axiom,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',only_member_in_singleton) ).
cnf(member_exists2,axiom,
( singleton(member_of(singleton(X1))) = singleton(X1)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',member_exists2) ).
cnf(set_in_its_singleton,axiom,
( member(X1,singleton(X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',set_in_its_singleton) ).
cnf(prove_member_of_singleton_is_unique_2,negated_conjecture,
member_of(singleton(u)) != u,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_member_of_singleton_is_unique_2) ).
cnf(prove_member_of_singleton_is_unique_1,negated_conjecture,
member(u,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_member_of_singleton_is_unique_1) ).
cnf(c_0_5,plain,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
inference(fof_simplification,[status(thm)],[only_member_in_singleton]) ).
cnf(c_0_6,plain,
( singleton(member_of(singleton(X1))) = singleton(X1)
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[member_exists2]) ).
cnf(c_0_7,plain,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
c_0_5 ).
cnf(c_0_8,plain,
( singleton(member_of(singleton(X1))) = singleton(X1)
| ~ member(X1,universal_class) ),
c_0_6 ).
cnf(c_0_9,plain,
( member(X1,singleton(X1))
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[set_in_its_singleton]) ).
cnf(c_0_10,negated_conjecture,
member_of(singleton(u)) != u,
inference(fof_simplification,[status(thm)],[prove_member_of_singleton_is_unique_2]) ).
cnf(c_0_11,plain,
( X1 = member_of(singleton(X2))
| ~ member(X1,singleton(X2))
| ~ member(X2,universal_class) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( member(X1,singleton(X1))
| ~ member(X1,universal_class) ),
c_0_9 ).
cnf(c_0_13,negated_conjecture,
member_of(singleton(u)) != u,
c_0_10 ).
cnf(c_0_14,plain,
( member_of(singleton(X1)) = X1
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
member(u,universal_class),
prove_member_of_singleton_is_unique_1 ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET090-7 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 12:07:22 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order model finding
% 0.20/0.46 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48 # Version: 3.1.0
% 0.20/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # new_bool_3 with pid 24154 completed with status 0
% 0.20/0.48 # Result found by new_bool_3
% 0.20/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 # Search class: FGHSM-FFMS21-MFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.48 # SAT001_MinMin_p005000_rr_RG with pid 24157 completed with status 0
% 0.20/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 # Search class: FGHSM-FFMS21-MFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.48 # Preprocessing time : 0.002 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Unsatisfiable
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 135
% 0.20/0.48 # Removed by relevancy pruning/SinE : 83
% 0.20/0.48 # Initial clauses : 52
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 52
% 0.20/0.48 # Processed clauses : 114
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 12
% 0.20/0.48 # ...remaining for further processing : 102
% 0.20/0.48 # Other redundant clauses eliminated : 5
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 0
% 0.20/0.48 # Backward-rewritten : 0
% 0.20/0.48 # Generated clauses : 143
% 0.20/0.48 # ...of the previous two non-redundant : 66
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 2
% 0.20/0.48 # Paramodulations : 136
% 0.20/0.48 # Factorizations : 1
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 6
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 59
% 0.20/0.48 # ...of those cached : 40
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 51
% 0.20/0.48 # Positive orientable unit clauses : 16
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 3
% 0.20/0.48 # Non-unit-clauses : 32
% 0.20/0.48 # Current number of unprocessed clauses: 53
% 0.20/0.48 # ...number of literals in the above : 136
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 49
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 147
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 129
% 0.20/0.48 # Non-unit clause-clause subsumptions : 13
% 0.20/0.48 # Unit Clause-clause subsumption calls : 3
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 14
% 0.20/0.48 # BW rewrite match successes : 6
% 0.20/0.48 # Condensation attempts : 0
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 3350
% 0.20/0.48 # Search garbage collected termcells : 464
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.009 s
% 0.20/0.48 # System time : 0.002 s
% 0.20/0.48 # Total time : 0.011 s
% 0.20/0.48 # Maximum resident set size: 1896 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.011 s
% 0.20/0.48 # System time : 0.005 s
% 0.20/0.48 # Total time : 0.016 s
% 0.20/0.48 # Maximum resident set size: 1804 pages
% 0.20/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------