TSTP Solution File: SET013-4 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : SET013-4 : TPTP v8.2.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n020.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:56:52 EDT 2024

% Result   : Unsatisfiable 0.18s 0.47s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   35 (  12 unt;   3 nHn;  32 RR)
%            Number of literals    :   72 (  15 equ;  36 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   47 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(extensionality3,axiom,
    ( X1 = X2
    | ~ member(f1(X1,X2),X1)
    | ~ member(f1(X1,X2),X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',extensionality3) ).

cnf(intersection3,axiom,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X2)
    | ~ member(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection3) ).

cnf(intersection2,axiom,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection2) ).

cnf(intersection_of_b_and_a_is_d,hypothesis,
    intersection(bs,as) = ds,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_of_b_and_a_is_d) ).

cnf(intersection1,axiom,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection1) ).

cnf(intersection_of_a_and_b_is_c,hypothesis,
    intersection(as,bs) = cs,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_of_a_and_b_is_c) ).

cnf(extensionality2,axiom,
    ( member(f1(X1,X2),X1)
    | member(f1(X1,X2),X2)
    | X1 = X2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',extensionality2) ).

cnf(prove_c_equals_d,negated_conjecture,
    cs != ds,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c_equals_d) ).

cnf(c_0_8,plain,
    ( X1 = X2
    | ~ member(f1(X1,X2),X1)
    | ~ member(f1(X1,X2),X2) ),
    inference(fof_simplification,[status(thm)],[extensionality3]) ).

cnf(c_0_9,plain,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X2)
    | ~ member(X1,X3) ),
    inference(fof_simplification,[status(thm)],[intersection3]) ).

cnf(c_0_10,plain,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    inference(fof_simplification,[status(thm)],[intersection2]) ).

cnf(c_0_11,plain,
    ( X1 = X2
    | ~ member(f1(X1,X2),X1)
    | ~ member(f1(X1,X2),X2) ),
    c_0_8 ).

cnf(c_0_12,plain,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X2)
    | ~ member(X1,X3) ),
    c_0_9 ).

cnf(c_0_13,plain,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    c_0_10 ).

cnf(c_0_14,hypothesis,
    intersection(bs,as) = ds,
    intersection_of_b_and_a_is_d ).

cnf(c_0_15,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    inference(fof_simplification,[status(thm)],[intersection1]) ).

cnf(c_0_16,plain,
    ( X1 = intersection(X2,X3)
    | ~ member(f1(X1,intersection(X2,X3)),X1)
    | ~ member(f1(X1,intersection(X2,X3)),X3)
    | ~ member(f1(X1,intersection(X2,X3)),X2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_17,hypothesis,
    intersection(as,bs) = cs,
    intersection_of_a_and_b_is_c ).

cnf(c_0_18,hypothesis,
    ( member(X1,as)
    | ~ member(X1,ds) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_19,axiom,
    ( member(f1(X1,X2),X1)
    | member(f1(X1,X2),X2)
    | X1 = X2 ),
    extensionality2 ).

cnf(c_0_20,negated_conjecture,
    cs != ds,
    inference(fof_simplification,[status(thm)],[prove_c_equals_d]) ).

cnf(c_0_21,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    c_0_15 ).

cnf(c_0_22,hypothesis,
    ( X1 = cs
    | ~ member(f1(X1,cs),bs)
    | ~ member(f1(X1,cs),as)
    | ~ member(f1(X1,cs),X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_23,hypothesis,
    ( ds = X1
    | member(f1(ds,X1),as)
    | member(f1(ds,X1),X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_24,negated_conjecture,
    cs != ds,
    c_0_20 ).

cnf(c_0_25,hypothesis,
    ( member(X1,bs)
    | ~ member(X1,ds) ),
    inference(spm,[status(thm)],[c_0_21,c_0_14]) ).

cnf(c_0_26,hypothesis,
    ( member(f1(ds,cs),cs)
    | ~ member(f1(ds,cs),ds) ),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25]) ).

cnf(c_0_27,hypothesis,
    member(f1(ds,cs),cs),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_19]),c_0_24]) ).

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

cnf(c_0_29,hypothesis,
    ~ member(f1(ds,cs),ds),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_27]),c_0_24]) ).

cnf(c_0_30,hypothesis,
    ( member(X1,ds)
    | ~ member(X1,as)
    | ~ member(X1,bs) ),
    inference(spm,[status(thm)],[c_0_12,c_0_14]) ).

cnf(c_0_31,hypothesis,
    member(f1(ds,cs),bs),
    inference(spm,[status(thm)],[c_0_28,c_0_27]) ).

cnf(c_0_32,hypothesis,
    ~ member(f1(ds,cs),as),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).

cnf(c_0_33,hypothesis,
    ( member(X1,as)
    | ~ member(X1,cs) ),
    inference(spm,[status(thm)],[c_0_21,c_0_17]) ).

cnf(c_0_34,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_27])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : SET013-4 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.12/0.34  % Computer : n020.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Mon May 20 11:53:38 EDT 2024
% 0.12/0.34  % CPUTime    : 
% 0.18/0.46  Running first-order model finding
% 0.18/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.18/0.47  # Version: 3.1.0
% 0.18/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47  # Starting sh5l with 300s (1) cores
% 0.18/0.47  # sh5l with pid 12421 completed with status 0
% 0.18/0.47  # Result found by sh5l
% 0.18/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47  # Starting sh5l with 300s (1) cores
% 0.18/0.47  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.47  # Search class: FGUSF-FFSF22-SFFFFFNN
% 0.18/0.47  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.47  # SAT001_MinMin_p005000_rr_RG with pid 12427 completed with status 0
% 0.18/0.47  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47  # Starting sh5l with 300s (1) cores
% 0.18/0.47  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.47  # Search class: FGUSF-FFSF22-SFFFFFNN
% 0.18/0.47  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.47  # Preprocessing time       : 0.001 s
% 0.18/0.47  # Presaturation interreduction done
% 0.18/0.47  
% 0.18/0.47  # Proof found!
% 0.18/0.47  # SZS status Unsatisfiable
% 0.18/0.47  # SZS output start CNFRefutation
% See solution above
% 0.18/0.48  # Parsed axioms                        : 12
% 0.18/0.48  # Removed by relevancy pruning/SinE    : 1
% 0.18/0.48  # Initial clauses                      : 11
% 0.18/0.48  # Removed in clause preprocessing      : 0
% 0.18/0.48  # Initial clauses in saturation        : 11
% 0.18/0.48  # Processed clauses                    : 58
% 0.18/0.48  # ...of these trivial                  : 0
% 0.18/0.48  # ...subsumed                          : 9
% 0.18/0.48  # ...remaining for further processing  : 49
% 0.18/0.48  # Other redundant clauses eliminated   : 0
% 0.18/0.48  # Clauses deleted for lack of memory   : 0
% 0.18/0.48  # Backward-subsumed                    : 0
% 0.18/0.48  # Backward-rewritten                   : 1
% 0.18/0.48  # Generated clauses                    : 100
% 0.18/0.48  # ...of the previous two non-redundant : 87
% 0.18/0.48  # ...aggressively subsumed             : 0
% 0.18/0.48  # Contextual simplify-reflections      : 3
% 0.18/0.48  # Paramodulations                      : 94
% 0.18/0.48  # Factorizations                       : 6
% 0.18/0.48  # NegExts                              : 0
% 0.18/0.48  # Equation resolutions                 : 0
% 0.18/0.48  # Disequality decompositions           : 0
% 0.18/0.48  # Total rewrite steps                  : 6
% 0.18/0.48  # ...of those cached                   : 3
% 0.18/0.48  # Propositional unsat checks           : 0
% 0.18/0.48  #    Propositional check models        : 0
% 0.18/0.48  #    Propositional check unsatisfiable : 0
% 0.18/0.48  #    Propositional clauses             : 0
% 0.18/0.48  #    Propositional clauses after purity: 0
% 0.18/0.48  #    Propositional unsat core size     : 0
% 0.18/0.48  #    Propositional preprocessing time  : 0.000
% 0.18/0.48  #    Propositional encoding time       : 0.000
% 0.18/0.48  #    Propositional solver time         : 0.000
% 0.18/0.48  #    Success case prop preproc time    : 0.000
% 0.18/0.48  #    Success case prop encoding time   : 0.000
% 0.18/0.48  #    Success case prop solver time     : 0.000
% 0.18/0.48  # Current number of processed clauses  : 37
% 0.18/0.48  #    Positive orientable unit clauses  : 6
% 0.18/0.48  #    Positive unorientable unit clauses: 0
% 0.18/0.48  #    Negative unit clauses             : 3
% 0.18/0.48  #    Non-unit-clauses                  : 28
% 0.18/0.48  # Current number of unprocessed clauses: 51
% 0.18/0.48  # ...number of literals in the above   : 165
% 0.18/0.48  # Current number of archived formulas  : 0
% 0.18/0.48  # Current number of archived clauses   : 12
% 0.18/0.48  # Clause-clause subsumption calls (NU) : 115
% 0.18/0.48  # Rec. Clause-clause subsumption calls : 106
% 0.18/0.48  # Non-unit clause-clause subsumptions  : 12
% 0.18/0.48  # Unit Clause-clause subsumption calls : 23
% 0.18/0.48  # Rewrite failures with RHS unbound    : 0
% 0.18/0.48  # BW rewrite match attempts            : 1
% 0.18/0.48  # BW rewrite match successes           : 1
% 0.18/0.48  # Condensation attempts                : 0
% 0.18/0.48  # Condensation successes               : 0
% 0.18/0.48  # Termbank termtop insertions          : 1511
% 0.18/0.48  # Search garbage collected termcells   : 19
% 0.18/0.48  
% 0.18/0.48  # -------------------------------------------------
% 0.18/0.48  # User time                : 0.004 s
% 0.18/0.48  # System time              : 0.003 s
% 0.18/0.48  # Total time               : 0.007 s
% 0.18/0.48  # Maximum resident set size: 1588 pages
% 0.18/0.48  
% 0.18/0.48  # -------------------------------------------------
% 0.18/0.48  # User time                : 0.004 s
% 0.18/0.48  # System time              : 0.006 s
% 0.18/0.48  # Total time               : 0.010 s
% 0.18/0.48  # Maximum resident set size: 1696 pages
% 0.18/0.48  % E---3.1 exiting
%------------------------------------------------------------------------------