↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET014-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n003.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 02:13:03 PM UTC 2026

% Result   : Unsatisfiable 39.35s 18.45s
% Output   : CNFRefutation 39.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   24 (   8 unt;   8 nHn;  19 RR)
%            Number of literals    :   48 (   0 equ;  17 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   36 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(membership_in_subsets,axiom,
    ( ~ subset(X2,X3)
    | ~ member(X1,X2)
    | member(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',membership_in_subsets) ).

cnf(member_of_union_is_member_of_one_set,axiom,
    ( ~ member(X1,union(X2,X3))
    | member(X1,X3)
    | member(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',member_of_union_is_member_of_one_set) ).

cnf(a_subset_of_c,hypothesis,
    subset(as,cs),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_subset_of_c) ).

cnf(subsets_axiom1,axiom,
    ( member(member_of_1_not_of_2(X1,X2),X1)
    | subset(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',subsets_axiom1) ).

cnf(b_subset_of_c,hypothesis,
    subset(bs,cs),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_subset_of_c) ).

cnf(subsets_axiom2,axiom,
    ( ~ member(member_of_1_not_of_2(X1,X2),X2)
    | subset(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',subsets_axiom2) ).

cnf(prove_a_union_b_subset_of_c,negated_conjecture,
    ~ subset(union(as,bs),cs),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_union_b_subset_of_c) ).

cnf(c_0_7,plain,
    ( ~ subset(X2,X3)
    | ~ member(X1,X2)
    | member(X1,X3) ),
    inference(fof_simplification,[status(thm)],[membership_in_subsets]) ).

cnf(c_0_8,plain,
    ( ~ member(X1,union(X2,X3))
    | member(X1,X3)
    | member(X1,X2) ),
    inference(fof_simplification,[status(thm)],[member_of_union_is_member_of_one_set]) ).

cnf(c_0_9,plain,
    ( ~ subset(X2,X3)
    | ~ member(X1,X2)
    | member(X1,X3) ),
    c_0_7 ).

cnf(c_0_10,hypothesis,
    subset(as,cs),
    a_subset_of_c ).

cnf(c_0_11,plain,
    ( ~ member(X1,union(X2,X3))
    | member(X1,X3)
    | member(X1,X2) ),
    c_0_8 ).

cnf(c_0_12,axiom,
    ( member(member_of_1_not_of_2(X1,X2),X1)
    | subset(X1,X2) ),
    subsets_axiom1 ).

cnf(c_0_13,hypothesis,
    subset(bs,cs),
    b_subset_of_c ).

cnf(c_0_14,hypothesis,
    ( ~ member(X1,as)
    | member(X1,cs) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_15,plain,
    ( member(member_of_1_not_of_2(union(X1,X2),X3),X1)
    | member(member_of_1_not_of_2(union(X1,X2),X3),X2)
    | subset(union(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,plain,
    ( ~ member(member_of_1_not_of_2(X1,X2),X2)
    | subset(X1,X2) ),
    inference(fof_simplification,[status(thm)],[subsets_axiom2]) ).

cnf(c_0_17,hypothesis,
    ( ~ member(X1,bs)
    | member(X1,cs) ),
    inference(spm,[status(thm)],[c_0_9,c_0_13]) ).

cnf(c_0_18,hypothesis,
    ( member(member_of_1_not_of_2(union(as,X1),X2),X1)
    | member(member_of_1_not_of_2(union(as,X1),X2),cs)
    | subset(union(as,X1),X2) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    ~ subset(union(as,bs),cs),
    inference(fof_simplification,[status(thm)],[prove_a_union_b_subset_of_c]) ).

cnf(c_0_20,plain,
    ( ~ member(member_of_1_not_of_2(X1,X2),X2)
    | subset(X1,X2) ),
    c_0_16 ).

cnf(c_0_21,hypothesis,
    ( member(member_of_1_not_of_2(union(as,bs),X1),cs)
    | subset(union(as,bs),X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    ~ subset(union(as,bs),cs),
    c_0_19 ).

cnf(c_0_23,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET014-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/10.38  % Computer : n003.cluster.edu
% 0.10/10.38  % Model    : x86_64 x86_64
% 0.10/10.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.38  % Memory   : 8046.5625MB
% 0.10/10.38  % OS       : Linux 6.8.0-71-generic
% 0.10/10.38  % CPULimit : 300
% 0.10/10.38  % WCLimit  : 300
% 0.10/10.38  % DateTime : Mon Sep 21 04:43:41 UTC 2026
% 0.10/10.39  % CPUTime  : 
% 0.10/10.39  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/10.43  Running first-order theorem proving
% 0.15/10.43  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 39.35/18.45  % Version: 3.5.1
% 39.35/18.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 39.35/18.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 39.35/18.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 39.35/18.45  % Starting new_bool_3 with 300s (1) cores
% 39.35/18.45  % Starting new_bool_1 with 300s (1) cores
% 39.35/18.45  % Starting sh5l with 300s (1) cores
% 39.35/18.45  % new_bool_3 with pid 3428579 completed with status 9
% 39.35/18.45  % new_bool_1 with pid 3428580 completed with status 9
% 39.35/18.45  % sh5l with pid 3428581 completed with status 0
% 39.35/18.45  % Result found by sh5l
% 39.35/18.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 39.35/18.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 39.35/18.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 39.35/18.45  % Starting new_bool_3 with 300s (1) cores
% 39.35/18.45  % Starting new_bool_1 with 300s (1) cores
% 39.35/18.45  % Starting sh5l with 300s (1) cores
% 39.35/18.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 39.35/18.45  % SinE strategy is gf500_gu_R04_F100_L20000
% 39.35/18.45  % Search class: FGUNF-FFSF22-SFFFFFNN
% 39.35/18.45  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 39.35/18.45  % Starting SubtermCWHack with 31s (1) cores
% 39.35/18.45  % SubtermCWHack with pid 3428583 completed with status 0
% 39.35/18.45  % Result found by SubtermCWHack
% 39.35/18.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 39.35/18.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 39.35/18.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 39.35/18.45  % Starting new_bool_3 with 300s (1) cores
% 39.35/18.45  % Starting new_bool_1 with 300s (1) cores
% 39.35/18.45  % Starting sh5l with 300s (1) cores
% 39.35/18.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 39.35/18.45  % SinE strategy is gf500_gu_R04_F100_L20000
% 39.35/18.45  % Search class: FGUNF-FFSF22-SFFFFFNN
% 39.35/18.45  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 39.35/18.45  % Starting SubtermCWHack with 31s (1) cores
% 39.35/18.45  % Preprocessing time       : 0.001 s
% 39.35/18.45  
% 39.35/18.45  % Proof found!
% 39.35/18.45  % SZS status Unsatisfiable
% 39.35/18.45  % SZS output start CNFRefutation
% See solution above
% 39.35/18.45  % Parsed axioms                        : 24
% 39.35/18.45  % Removed by relevancy pruning/SinE    : 6
% 39.35/18.45  % Initial clauses                      : 18
% 39.35/18.45  % Removed in clause preprocessing      : 0
% 39.35/18.45  % Initial clauses in saturation        : 18
% 39.35/18.45  % Processed clauses                    : 18667
% 39.35/18.45  % ...of these trivial                  : 1070
% 39.35/18.45  % ...subsumed                          : 12548
% 39.35/18.45  % ...remaining for further processing  : 5049
% 39.35/18.45  % Other redundant clauses eliminated   : 0
% 39.35/18.45  % Clauses deleted for lack of memory   : 0
% 39.35/18.45  % Backward-subsumed                    : 232
% 39.35/18.45  % Backward-rewritten                   : 113
% 39.35/18.45  % Generated clauses                    : 399056
% 39.35/18.45  % ...of the previous two non-redundant : 375381
% 39.35/18.45  % ...aggressively subsumed             : 0
% 39.35/18.45  % Contextual simplify-reflections      : 25
% 39.35/18.45  % Paramodulations                      : 398698
% 39.35/18.45  % Factorizations                       : 358
% 39.35/18.45  % NegExts                              : 0
% 39.35/18.45  % Equation resolutions                 : 0
% 39.35/18.45  % Disequality decompositions           : 0
% 39.35/18.45  % Total rewrite steps                  : 43116
% 39.35/18.45  % ...of those cached                   : 37413
% 39.35/18.45  % Propositional unsat checks           : 0
% 39.35/18.45  %    Propositional check models        : 0
% 39.35/18.45  %    Propositional check unsatisfiable : 0
% 39.35/18.45  %    Propositional clauses             : 0
% 39.35/18.45  %    Propositional clauses after purity: 0
% 39.35/18.45  %    Propositional unsat core size     : 0
% 39.35/18.45  %    Propositional preprocessing time  : 0.000
% 39.35/18.45  %    Propositional encoding time       : 0.000
% 39.35/18.45  %    Propositional solver time         : 0.000
% 39.35/18.45  %    Success case prop preproc time    : 0.000
% 39.35/18.45  %    Success case prop encoding time   : 0.000
% 39.35/18.45  %    Success case prop solver time     : 0.000
% 39.35/18.45  % Current number of processed clauses  : 4704
% 39.35/18.45  %    Positive orientable unit clauses  : 1579
% 39.35/18.45  %    Positive unorientable unit clauses: 0
% 39.35/18.45  %    Negative unit clauses             : 1
% 39.35/18.45  %    Non-unit-clauses                  : 3124
% 39.35/18.45  % Current number of unprocessed clauses: 356225
% 39.35/18.45  % ...number of literals in the above   : 880647
% 39.35/18.45  % Current number of archived formulas  : 0
% 39.35/18.45  % Current number of archived clauses   : 345
% 39.35/18.45  % Clause-clause subsumption calls (NU) : 689304
% 39.35/18.45  % Rec. Clause-clause subsumption calls : 616513
% 39.35/18.45  % Non-unit clause-clause subsumptions  : 12798
% 39.35/18.45  % Unit Clause-clause subsumption calls : 116159
% 39.35/18.45  % Rewrite failures with RHS unbound    : 0
% 39.35/18.45  % BW rewrite match attempts            : 11073
% 39.35/18.45  % BW rewrite match successes           : 110
% 39.35/18.45  % Condensation attempts                : 0
% 39.35/18.45  % Condensation successes               : 0
% 39.35/18.45  % Termbank termtop insertions          : 9561027
% 39.35/18.45  % Search garbage collected termcells   : 55
% 39.35/18.45  
% 39.35/18.45  % -------------------------------------------------
% 39.35/18.45  % User time                : 7.363 s
% 39.35/18.45  % System time              : 0.343 s
% 39.35/18.45  % Total time               : 7.707 s
% 39.35/18.45  % Maximum resident set size: 3852 pages
% 39.35/18.45  
% 39.35/18.45  % -------------------------------------------------
% 39.35/18.45  % User time                : 7.410 s
% 39.35/18.45  % System time              : 0.374 s
% 39.35/18.45  % Total time               : 7.784 s
% 39.35/18.45  % Maximum resident set size: 4864 pages
% 39.35/18.45  % E exiting
%------------------------------------------------------------------------------