TSTP Solution File: SET093-7 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET093-7 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:32 EDT 2024
% Result : Unsatisfiable 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 8 unt; 0 nHn; 6 RR)
% Number of literals : 8 ( 2 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 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 : 2 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_corollary_2_to_singletons_are_sets_2,negated_conjecture,
~ member(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_2_to_singletons_are_sets_2) ).
cnf(singletons_are_sets,axiom,
member(singleton(X1),universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singletons_are_sets) ).
cnf(prove_corollary_2_to_singletons_are_sets_1,negated_conjecture,
singleton(member_of(x)) = x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_2_to_singletons_are_sets_1) ).
cnf(c_0_3,negated_conjecture,
~ member(x,universal_class),
inference(fof_simplification,[status(thm)],[prove_corollary_2_to_singletons_are_sets_2]) ).
cnf(c_0_4,axiom,
member(singleton(X1),universal_class),
singletons_are_sets ).
cnf(c_0_5,negated_conjecture,
singleton(member_of(x)) = x,
prove_corollary_2_to_singletons_are_sets_1 ).
cnf(c_0_6,negated_conjecture,
~ member(x,universal_class),
c_0_3 ).
cnf(c_0_7,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SET093-7 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n022.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon May 20 13:05:07 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 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.14/0.41 # Version: 3.1.0
% 0.14/0.41 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # new_bool_3 with pid 30343 completed with status 0
% 0.14/0.41 # Result found by new_bool_3
% 0.14/0.41 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 # Search class: FGHSM-FFMS21-MFFFFFNN
% 0.14/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.41 # SAT001_MinMin_p005000_rr_RG with pid 30346 completed with status 0
% 0.14/0.41 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/0.41 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 # Search class: FGHSM-FFMS21-MFFFFFNN
% 0.14/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.41 # Preprocessing time : 0.002 s
% 0.14/0.41 # Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 # Proof found!
% 0.14/0.41 # SZS status Unsatisfiable
% 0.14/0.41 # SZS output start CNFRefutation
% See solution above
% 0.14/0.41 # Parsed axioms : 138
% 0.14/0.41 # Removed by relevancy pruning/SinE : 85
% 0.14/0.41 # Initial clauses : 53
% 0.14/0.41 # Removed in clause preprocessing : 0
% 0.14/0.41 # Initial clauses in saturation : 53
% 0.14/0.41 # Processed clauses : 58
% 0.14/0.41 # ...of these trivial : 0
% 0.14/0.41 # ...subsumed : 1
% 0.14/0.41 # ...remaining for further processing : 57
% 0.14/0.41 # Other redundant clauses eliminated : 2
% 0.14/0.41 # Clauses deleted for lack of memory : 0
% 0.14/0.41 # Backward-subsumed : 0
% 0.14/0.41 # Backward-rewritten : 0
% 0.14/0.41 # Generated clauses : 3
% 0.14/0.41 # ...of the previous two non-redundant : 0
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 0
% 0.14/0.41 # Paramodulations : 1
% 0.14/0.41 # Factorizations : 0
% 0.14/0.41 # NegExts : 0
% 0.14/0.41 # Equation resolutions : 2
% 0.14/0.41 # Disequality decompositions : 0
% 0.14/0.41 # Total rewrite steps : 2
% 0.14/0.41 # ...of those cached : 1
% 0.14/0.41 # Propositional unsat checks : 0
% 0.14/0.41 # Propositional check models : 0
% 0.14/0.41 # Propositional check unsatisfiable : 0
% 0.14/0.41 # Propositional clauses : 0
% 0.14/0.41 # Propositional clauses after purity: 0
% 0.14/0.41 # Propositional unsat core size : 0
% 0.14/0.41 # Propositional preprocessing time : 0.000
% 0.14/0.41 # Propositional encoding time : 0.000
% 0.14/0.41 # Propositional solver time : 0.000
% 0.14/0.41 # Success case prop preproc time : 0.000
% 0.14/0.41 # Success case prop encoding time : 0.000
% 0.14/0.41 # Success case prop solver time : 0.000
% 0.14/0.41 # Current number of processed clauses : 5
% 0.14/0.41 # Positive orientable unit clauses : 3
% 0.14/0.41 # Positive unorientable unit clauses: 0
% 0.14/0.41 # Negative unit clauses : 2
% 0.14/0.41 # Non-unit-clauses : 0
% 0.14/0.41 # Current number of unprocessed clauses: 45
% 0.14/0.41 # ...number of literals in the above : 91
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 50
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 73
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 58
% 0.14/0.41 # Non-unit clause-clause subsumptions : 1
% 0.14/0.41 # Unit Clause-clause subsumption calls : 1
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 8
% 0.14/0.41 # BW rewrite match successes : 4
% 0.14/0.41 # Condensation attempts : 0
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 2000
% 0.14/0.41 # Search garbage collected termcells : 472
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.004 s
% 0.14/0.41 # System time : 0.002 s
% 0.14/0.41 # Total time : 0.006 s
% 0.14/0.41 # Maximum resident set size: 1868 pages
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.006 s
% 0.14/0.41 # System time : 0.005 s
% 0.14/0.41 # Total time : 0.011 s
% 0.14/0.41 # Maximum resident set size: 1804 pages
% 0.14/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------