↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : TOP001-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n009.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 03:53:48 PM UTC 2026

% Result   : Unsatisfiable 0.12s 0.45s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   44 (   7 unt;   4 nHn;  40 RR)
%            Number of literals    :   97 (   0 equ;  52 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-3 aty)
%            Number of variables   :   88 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(union_of_members_3,axiom,
    ( ~ element_of_collection(X3,X2)
    | ~ element_of_set(X1,X3)
    | element_of_set(X1,union_of_members(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_of_members_3) ).

cnf(topology_generated_38,axiom,
    ( ~ element_of_set(X3,X1)
    | ~ element_of_collection(X1,top_of_basis(X2))
    | element_of_collection(f10(X2,X1,X3),X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',topology_generated_38) ).

cnf(topology_generated_37,axiom,
    ( ~ element_of_set(X3,X1)
    | ~ element_of_collection(X1,top_of_basis(X2))
    | element_of_set(X3,f10(X2,X1,X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',topology_generated_37) ).

cnf(set_theory_3,axiom,
    ( ~ equal_sets(X1,X2)
    | subset_sets(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',set_theory_3) ).

cnf(basis_for_topology_28,axiom,
    ( ~ basis(X1,X2)
    | equal_sets(union_of_members(X2),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',basis_for_topology_28) ).

cnf(union_of_members_2,axiom,
    ( ~ element_of_set(X1,union_of_members(X2))
    | element_of_collection(f1(X2,X1),X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_of_members_2) ).

cnf(union_of_members_1,axiom,
    ( ~ element_of_set(X1,union_of_members(X2))
    | element_of_set(X1,f1(X2,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_of_members_1) ).

cnf(set_theory_2,axiom,
    ( ~ element_of_set(X3,X1)
    | ~ subset_sets(X1,X2)
    | element_of_set(X3,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',set_theory_2) ).

cnf(lemma_1a_1,negated_conjecture,
    basis(cx,f),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_1a_1) ).

cnf(set_theory_4,axiom,
    ( element_of_set(in_1st_set(X1,X2),X1)
    | subset_sets(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',set_theory_4) ).

cnf(set_theory_5,axiom,
    ( ~ element_of_set(in_1st_set(X1,X2),X2)
    | subset_sets(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',set_theory_5) ).

cnf(lemma_1a_2,negated_conjecture,
    ~ subset_sets(union_of_members(top_of_basis(f)),cx),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_1a_2) ).

cnf(c_0_12,plain,
    ( ~ element_of_collection(X3,X2)
    | ~ element_of_set(X1,X3)
    | element_of_set(X1,union_of_members(X2)) ),
    inference(fof_simplification,[status(thm)],[union_of_members_3]) ).

cnf(c_0_13,plain,
    ( ~ element_of_set(X3,X1)
    | ~ element_of_collection(X1,top_of_basis(X2))
    | element_of_collection(f10(X2,X1,X3),X2) ),
    inference(fof_simplification,[status(thm)],[topology_generated_38]) ).

cnf(c_0_14,plain,
    ( ~ element_of_collection(X3,X2)
    | ~ element_of_set(X1,X3)
    | element_of_set(X1,union_of_members(X2)) ),
    c_0_12 ).

cnf(c_0_15,plain,
    ( ~ element_of_set(X3,X1)
    | ~ element_of_collection(X1,top_of_basis(X2))
    | element_of_collection(f10(X2,X1,X3),X2) ),
    c_0_13 ).

cnf(c_0_16,plain,
    ( ~ element_of_set(X3,X1)
    | ~ element_of_collection(X1,top_of_basis(X2))
    | element_of_set(X3,f10(X2,X1,X3)) ),
    inference(fof_simplification,[status(thm)],[topology_generated_37]) ).

cnf(c_0_17,plain,
    ( ~ equal_sets(X1,X2)
    | subset_sets(X1,X2) ),
    inference(fof_simplification,[status(thm)],[set_theory_3]) ).

cnf(c_0_18,plain,
    ( ~ basis(X1,X2)
    | equal_sets(union_of_members(X2),X1) ),
    inference(fof_simplification,[status(thm)],[basis_for_topology_28]) ).

cnf(c_0_19,plain,
    ( ~ element_of_set(X4,X3)
    | ~ element_of_set(X1,f10(X2,X3,X4))
    | ~ element_of_collection(X3,top_of_basis(X2))
    | element_of_set(X1,union_of_members(X2)) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_20,plain,
    ( ~ element_of_set(X3,X1)
    | ~ element_of_collection(X1,top_of_basis(X2))
    | element_of_set(X3,f10(X2,X1,X3)) ),
    c_0_16 ).

cnf(c_0_21,plain,
    ( ~ element_of_set(X1,union_of_members(X2))
    | element_of_collection(f1(X2,X1),X2) ),
    inference(fof_simplification,[status(thm)],[union_of_members_2]) ).

cnf(c_0_22,plain,
    ( ~ equal_sets(X1,X2)
    | subset_sets(X1,X2) ),
    c_0_17 ).

cnf(c_0_23,plain,
    ( ~ basis(X1,X2)
    | equal_sets(union_of_members(X2),X1) ),
    c_0_18 ).

cnf(c_0_24,plain,
    ( ~ element_of_set(X1,X3)
    | ~ element_of_collection(X3,top_of_basis(X2))
    | element_of_set(X1,union_of_members(X2)) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_25,plain,
    ( ~ element_of_set(X1,union_of_members(X2))
    | element_of_collection(f1(X2,X1),X2) ),
    c_0_21 ).

cnf(c_0_26,plain,
    ( ~ element_of_set(X1,union_of_members(X2))
    | element_of_set(X1,f1(X2,X1)) ),
    inference(fof_simplification,[status(thm)],[union_of_members_1]) ).

cnf(c_0_27,plain,
    ( ~ element_of_set(X3,X1)
    | ~ subset_sets(X1,X2)
    | element_of_set(X3,X2) ),
    inference(fof_simplification,[status(thm)],[set_theory_2]) ).

cnf(c_0_28,plain,
    ( ~ basis(X2,X1)
    | subset_sets(union_of_members(X1),X2) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_29,negated_conjecture,
    basis(cx,f),
    lemma_1a_1 ).

cnf(c_0_30,plain,
    ( ~ element_of_set(X3,union_of_members(top_of_basis(X2)))
    | ~ element_of_set(X1,f1(top_of_basis(X2),X3))
    | element_of_set(X1,union_of_members(X2)) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_31,plain,
    ( ~ element_of_set(X1,union_of_members(X2))
    | element_of_set(X1,f1(X2,X1)) ),
    c_0_26 ).

cnf(c_0_32,plain,
    ( ~ element_of_set(X3,X1)
    | ~ subset_sets(X1,X2)
    | element_of_set(X3,X2) ),
    c_0_27 ).

cnf(c_0_33,negated_conjecture,
    subset_sets(union_of_members(f),cx),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_34,plain,
    ( ~ element_of_set(X1,union_of_members(top_of_basis(X2)))
    | element_of_set(X1,union_of_members(X2)) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_35,axiom,
    ( element_of_set(in_1st_set(X1,X2),X1)
    | subset_sets(X1,X2) ),
    set_theory_4 ).

cnf(c_0_36,plain,
    ( ~ element_of_set(in_1st_set(X1,X2),X2)
    | subset_sets(X1,X2) ),
    inference(fof_simplification,[status(thm)],[set_theory_5]) ).

cnf(c_0_37,negated_conjecture,
    ( ~ element_of_set(X1,union_of_members(f))
    | element_of_set(X1,cx) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_38,plain,
    ( element_of_set(in_1st_set(union_of_members(top_of_basis(X1)),X2),union_of_members(X1))
    | subset_sets(union_of_members(top_of_basis(X1)),X2) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_39,negated_conjecture,
    ~ subset_sets(union_of_members(top_of_basis(f)),cx),
    inference(fof_simplification,[status(thm)],[lemma_1a_2]) ).

cnf(c_0_40,plain,
    ( ~ element_of_set(in_1st_set(X1,X2),X2)
    | subset_sets(X1,X2) ),
    c_0_36 ).

cnf(c_0_41,negated_conjecture,
    ( element_of_set(in_1st_set(union_of_members(top_of_basis(f)),X1),cx)
    | subset_sets(union_of_members(top_of_basis(f)),X1) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_42,negated_conjecture,
    ~ subset_sets(union_of_members(top_of_basis(f)),cx),
    c_0_39 ).

cnf(c_0_43,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : TOP001-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38  % Computer : n009.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Mon Sep 21 12:37:58 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.43  Running first-order theorem proving
% 0.12/0.43  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.12/0.45  % Version: 3.5.1
% 0.12/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45  % Starting sh5l with 300s (1) cores
% 0.12/0.45  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1755943 completed with status 0
% 0.12/0.45  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.45  % No SInE strategy applied
% 0.12/0.45  % Search class: FGUNF-FFSF31-SFFFFFNN
% 0.12/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.45  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.12/0.45  % Starting new_bool_3 with 136s (1) cores
% 0.12/0.45  % Starting new_bool_1 with 136s (1) cores
% 0.12/0.45  % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 1755950 completed with status 0
% 0.12/0.45  % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.45  % No SInE strategy applied
% 0.12/0.45  % Search class: FGUNF-FFSF31-SFFFFFNN
% 0.12/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.45  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.12/0.45  % Preprocessing time       : 0.001 s
% 0.12/0.45  % Presaturation interreduction done
% 0.12/0.45  
% 0.12/0.45  % Proof found!
% 0.12/0.45  % SZS status Unsatisfiable
% 0.12/0.45  % SZS output start CNFRefutation
% See solution above
% 0.12/0.45  % Parsed axioms                        : 13
% 0.12/0.45  % Removed by relevancy pruning/SinE    : 0
% 0.12/0.45  % Initial clauses                      : 13
% 0.12/0.45  % Removed in clause preprocessing      : 0
% 0.12/0.45  % Initial clauses in saturation        : 13
% 0.12/0.45  % Processed clauses                    : 40
% 0.12/0.45  % ...of these trivial                  : 0
% 0.12/0.45  % ...subsumed                          : 1
% 0.12/0.45  % ...remaining for further processing  : 39
% 0.12/0.45  % Other redundant clauses eliminated   : 0
% 0.12/0.45  % Clauses deleted for lack of memory   : 0
% 0.12/0.45  % Backward-subsumed                    : 0
% 0.12/0.45  % Backward-rewritten                   : 0
% 0.12/0.45  % Generated clauses                    : 25
% 0.12/0.45  % ...of the previous two non-redundant : 20
% 0.12/0.45  % ...aggressively subsumed             : 0
% 0.12/0.45  % Contextual simplify-reflections      : 0
% 0.12/0.45  % Paramodulations                      : 25
% 0.12/0.45  % Factorizations                       : 0
% 0.12/0.45  % NegExts                              : 0
% 0.12/0.45  % Equation resolutions                 : 0
% 0.12/0.45  % Disequality decompositions           : 0
% 0.12/0.45  % Total rewrite steps                  : 2
% 0.12/0.45  % ...of those cached                   : 0
% 0.12/0.45  % Propositional unsat checks           : 0
% 0.12/0.45  %    Propositional check models        : 0
% 0.12/0.45  %    Propositional check unsatisfiable : 0
% 0.12/0.45  %    Propositional clauses             : 0
% 0.12/0.45  %    Propositional clauses after purity: 0
% 0.12/0.45  %    Propositional unsat core size     : 0
% 0.12/0.45  %    Propositional preprocessing time  : 0.000
% 0.12/0.45  %    Propositional encoding time       : 0.000
% 0.12/0.45  %    Propositional solver time         : 0.000
% 0.12/0.45  %    Success case prop preproc time    : 0.000
% 0.12/0.45  %    Success case prop encoding time   : 0.000
% 0.12/0.45  %    Success case prop solver time     : 0.000
% 0.12/0.45  % Current number of processed clauses  : 26
% 0.12/0.45  %    Positive orientable unit clauses  : 4
% 0.12/0.45  %    Positive unorientable unit clauses: 0
% 0.12/0.45  %    Negative unit clauses             : 1
% 0.12/0.45  %    Non-unit-clauses                  : 21
% 0.12/0.45  % Current number of unprocessed clauses: 6
% 0.12/0.45  % ...number of literals in the above   : 19
% 0.12/0.45  % Current number of archived formulas  : 0
% 0.12/0.45  % Current number of archived clauses   : 13
% 0.12/0.45  % Clause-clause subsumption calls (NU) : 86
% 0.12/0.45  % Rec. Clause-clause subsumption calls : 83
% 0.12/0.45  % Non-unit clause-clause subsumptions  : 1
% 0.12/0.45  % Unit Clause-clause subsumption calls : 2
% 0.12/0.45  % Rewrite failures with RHS unbound    : 0
% 0.12/0.45  % BW rewrite match attempts            : 2
% 0.12/0.45  % BW rewrite match successes           : 0
% 0.12/0.45  % Condensation attempts                : 0
% 0.12/0.45  % Condensation successes               : 0
% 0.12/0.45  % Termbank termtop insertions          : 921
% 0.12/0.45  % Search garbage collected termcells   : 31
% 0.12/0.45  
% 0.12/0.45  % -------------------------------------------------
% 0.12/0.45  % User time                : 0.003 s
% 0.12/0.45  % System time              : 0.002 s
% 0.12/0.45  % Total time               : 0.006 s
% 0.12/0.45  % Maximum resident set size: 3640 pages
% 0.12/0.45  
% 0.12/0.45  % -------------------------------------------------
% 0.12/0.45  % User time                : 0.010 s
% 0.12/0.45  % System time              : 0.014 s
% 0.12/0.45  % Total time               : 0.024 s
% 0.12/0.45  % Maximum resident set size: 4608 pages
% 0.12/0.45  % E exiting
%------------------------------------------------------------------------------