TSTP Solution File: SET787-2 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : SET787-2 : TPTP v8.2.0. Released v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n005.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:59:52 EDT 2024

% Result   : Unsatisfiable 0.62s 0.55s
% Output   : CNFRefutation 0.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   30 (  12 unt;   6 nHn;  24 RR)
%            Number of literals    :   52 (   8 equ;  24 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   45 (   9 sgn)

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

cnf(clause120,axiom,
    ( member(unionE_sk1(X1,X2),X2)
    | ~ member(X1,union(X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause120) ).

cnf(un_eq_Union_2_c1,negated_conjecture,
    member(sk2,union(cons(a,cons(b,eptset)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',un_eq_Union_2_c1) ).

cnf(clause158,axiom,
    ~ member(X1,eptset),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause158) ).

cnf(un_eq_Union_2_c2,negated_conjecture,
    ~ member(sk2,un(a,b)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',un_eq_Union_2_c2) ).

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

cnf(clause119,axiom,
    ( member(X1,unionE_sk1(X1,X2))
    | ~ member(X1,union(X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause119) ).

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

cnf(c_0_8,plain,
    ( X1 = X2
    | member(X1,X3)
    | ~ member(X1,cons(X2,X3)) ),
    inference(fof_simplification,[status(thm)],[clause112]) ).

cnf(c_0_9,plain,
    ( member(unionE_sk1(X1,X2),X2)
    | ~ member(X1,union(X2)) ),
    inference(fof_simplification,[status(thm)],[clause120]) ).

cnf(c_0_10,plain,
    ( X1 = X2
    | member(X1,X3)
    | ~ member(X1,cons(X2,X3)) ),
    c_0_8 ).

cnf(c_0_11,plain,
    ( member(unionE_sk1(X1,X2),X2)
    | ~ member(X1,union(X2)) ),
    c_0_9 ).

cnf(c_0_12,plain,
    ( unionE_sk1(X1,cons(X2,X3)) = X2
    | member(unionE_sk1(X1,cons(X2,X3)),X3)
    | ~ member(X1,union(cons(X2,X3))) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,negated_conjecture,
    member(sk2,union(cons(a,cons(b,eptset)))),
    un_eq_Union_2_c1 ).

cnf(c_0_14,plain,
    ~ member(X1,eptset),
    inference(fof_simplification,[status(thm)],[clause158]) ).

cnf(c_0_15,negated_conjecture,
    ~ member(sk2,un(a,b)),
    inference(fof_simplification,[status(thm)],[un_eq_Union_2_c2]) ).

cnf(c_0_16,plain,
    ( member(X1,un(X3,X2))
    | ~ member(X1,X2) ),
    inference(fof_simplification,[status(thm)],[clause19]) ).

cnf(c_0_17,plain,
    ( member(X1,unionE_sk1(X1,X2))
    | ~ member(X1,union(X2)) ),
    inference(fof_simplification,[status(thm)],[clause119]) ).

cnf(c_0_18,negated_conjecture,
    ( unionE_sk1(sk2,cons(a,cons(b,eptset))) = a
    | member(unionE_sk1(sk2,cons(a,cons(b,eptset))),cons(b,eptset)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_19,plain,
    ~ member(X1,eptset),
    c_0_14 ).

cnf(c_0_20,negated_conjecture,
    ~ member(sk2,un(a,b)),
    c_0_15 ).

cnf(c_0_21,plain,
    ( member(X1,un(X3,X2))
    | ~ member(X1,X2) ),
    c_0_16 ).

cnf(c_0_22,plain,
    ( member(X1,un(X2,X3))
    | ~ member(X1,X2) ),
    inference(fof_simplification,[status(thm)],[clause20]) ).

cnf(c_0_23,plain,
    ( member(X1,unionE_sk1(X1,X2))
    | ~ member(X1,union(X2)) ),
    c_0_17 ).

cnf(c_0_24,negated_conjecture,
    ( unionE_sk1(sk2,cons(a,cons(b,eptset))) = a
    | unionE_sk1(sk2,cons(a,cons(b,eptset))) = b ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_18]),c_0_19]) ).

cnf(c_0_25,negated_conjecture,
    ~ member(sk2,b),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_26,plain,
    ( member(X1,un(X2,X3))
    | ~ member(X1,X2) ),
    c_0_22 ).

cnf(c_0_27,negated_conjecture,
    unionE_sk1(sk2,cons(a,cons(b,eptset))) = a,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_13])]),c_0_25]) ).

cnf(c_0_28,negated_conjecture,
    ~ member(sk2,a),
    inference(spm,[status(thm)],[c_0_20,c_0_26]) ).

cnf(c_0_29,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_27]),c_0_13])]),c_0_28]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SET787-2 : TPTP v8.2.0. Released v2.7.0.
% 0.03/0.14  % Command    : run_E %s %d THM
% 0.12/0.35  % Computer : n005.cluster.edu
% 0.12/0.35  % Model    : x86_64 x86_64
% 0.12/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35  % Memory   : 8042.1875MB
% 0.12/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35  % CPULimit   : 300
% 0.12/0.35  % WCLimit    : 300
% 0.12/0.35  % DateTime   : Mon May 20 12:39:08 EDT 2024
% 0.12/0.35  % CPUTime    : 
% 0.19/0.47  Running first-order model finding
% 0.19/0.47  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.62/0.55  # Version: 3.1.0
% 0.62/0.55  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.62/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.62/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.62/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.62/0.55  # Starting new_bool_1 with 300s (1) cores
% 0.62/0.55  # Starting sh5l with 300s (1) cores
% 0.62/0.55  # sh5l with pid 28817 completed with status 0
% 0.62/0.55  # Result found by sh5l
% 0.62/0.55  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.62/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.62/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.62/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.62/0.55  # Starting new_bool_1 with 300s (1) cores
% 0.62/0.55  # Starting sh5l with 300s (1) cores
% 0.62/0.55  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.62/0.55  # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.62/0.55  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.62/0.55  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.62/0.55  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 28818 completed with status 0
% 0.62/0.55  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.62/0.55  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.62/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.62/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.62/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.62/0.55  # Starting new_bool_1 with 300s (1) cores
% 0.62/0.55  # Starting sh5l with 300s (1) cores
% 0.62/0.55  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.62/0.55  # Search class: FGHSM-FFMF31-MFFFFFNN
% 0.62/0.55  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.62/0.55  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.62/0.55  # Preprocessing time       : 0.002 s
% 0.62/0.55  # Presaturation interreduction done
% 0.62/0.55  
% 0.62/0.55  # Proof found!
% 0.62/0.55  # SZS status Unsatisfiable
% 0.62/0.55  # SZS output start CNFRefutation
% See solution above
% 0.62/0.55  # Parsed axioms                        : 149
% 0.62/0.55  # Removed by relevancy pruning/SinE    : 64
% 0.62/0.55  # Initial clauses                      : 85
% 0.62/0.55  # Removed in clause preprocessing      : 4
% 0.62/0.55  # Initial clauses in saturation        : 81
% 0.62/0.55  # Processed clauses                    : 588
% 0.62/0.55  # ...of these trivial                  : 36
% 0.62/0.55  # ...subsumed                          : 172
% 0.62/0.55  # ...remaining for further processing  : 380
% 0.62/0.55  # Other redundant clauses eliminated   : 5
% 0.62/0.55  # Clauses deleted for lack of memory   : 0
% 0.62/0.55  # Backward-subsumed                    : 0
% 0.62/0.55  # Backward-rewritten                   : 17
% 0.62/0.55  # Generated clauses                    : 2807
% 0.62/0.55  # ...of the previous two non-redundant : 2671
% 0.62/0.55  # ...aggressively subsumed             : 0
% 0.62/0.55  # Contextual simplify-reflections      : 0
% 0.62/0.55  # Paramodulations                      : 2776
% 0.62/0.55  # Factorizations                       : 13
% 0.62/0.55  # NegExts                              : 0
% 0.62/0.55  # Equation resolutions                 : 18
% 0.62/0.55  # Disequality decompositions           : 0
% 0.62/0.55  # Total rewrite steps                  : 1300
% 0.62/0.55  # ...of those cached                   : 1250
% 0.62/0.55  # Propositional unsat checks           : 0
% 0.62/0.55  #    Propositional check models        : 0
% 0.62/0.55  #    Propositional check unsatisfiable : 0
% 0.62/0.55  #    Propositional clauses             : 0
% 0.62/0.55  #    Propositional clauses after purity: 0
% 0.62/0.55  #    Propositional unsat core size     : 0
% 0.62/0.55  #    Propositional preprocessing time  : 0.000
% 0.62/0.55  #    Propositional encoding time       : 0.000
% 0.62/0.55  #    Propositional solver time         : 0.000
% 0.62/0.55  #    Success case prop preproc time    : 0.000
% 0.62/0.55  #    Success case prop encoding time   : 0.000
% 0.62/0.55  #    Success case prop solver time     : 0.000
% 0.62/0.55  # Current number of processed clauses  : 290
% 0.62/0.55  #    Positive orientable unit clauses  : 73
% 0.62/0.55  #    Positive unorientable unit clauses: 0
% 0.62/0.55  #    Negative unit clauses             : 14
% 0.62/0.55  #    Non-unit-clauses                  : 203
% 0.62/0.55  # Current number of unprocessed clauses: 2206
% 0.62/0.55  # ...number of literals in the above   : 5257
% 0.62/0.55  # Current number of archived formulas  : 0
% 0.62/0.55  # Current number of archived clauses   : 85
% 0.62/0.55  # Clause-clause subsumption calls (NU) : 5011
% 0.62/0.55  # Rec. Clause-clause subsumption calls : 4224
% 0.62/0.55  # Non-unit clause-clause subsumptions  : 95
% 0.62/0.55  # Unit Clause-clause subsumption calls : 590
% 0.62/0.55  # Rewrite failures with RHS unbound    : 0
% 0.62/0.55  # BW rewrite match attempts            : 231
% 0.62/0.55  # BW rewrite match successes           : 13
% 0.62/0.55  # Condensation attempts                : 0
% 0.62/0.55  # Condensation successes               : 0
% 0.62/0.55  # Termbank termtop insertions          : 46834
% 0.62/0.55  # Search garbage collected termcells   : 416
% 0.62/0.55  
% 0.62/0.55  # -------------------------------------------------
% 0.62/0.55  # User time                : 0.053 s
% 0.62/0.55  # System time              : 0.007 s
% 0.62/0.55  # Total time               : 0.060 s
% 0.62/0.55  # Maximum resident set size: 2036 pages
% 0.62/0.55  
% 0.62/0.55  # -------------------------------------------------
% 0.62/0.55  # User time                : 0.055 s
% 0.62/0.55  # System time              : 0.010 s
% 0.62/0.55  # Total time               : 0.065 s
% 0.62/0.55  # Maximum resident set size: 1804 pages
% 0.62/0.55  % E---3.1 exiting
%------------------------------------------------------------------------------