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

View Problem - Process Solution

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

% Computer : n003.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 : Mon May 20 19:03:17 EDT 2024

% Result   : Unsatisfiable 8.55s 1.62s
% Output   : CNFRefutation 8.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   37 (  11 unt;   0 nHn;  35 RR)
%            Number of literals    :   83 (   0 equ;  52 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-4 aty)
%            Number of variables   :   65 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(transD,axiom,
    ( member(pair(X2,X4),X1)
    | ~ trans(X1)
    | ~ member(pair(X2,X3),X1)
    | ~ member(pair(X3,X4),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transD) ).

cnf(r_into_trancl,axiom,
    ( member(pair(X1,X2),trancl(X3))
    | ~ member(pair(X1,X2),X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',r_into_trancl) ).

cnf(diamond_trancl_2h5,hypothesis,
    ( member(pair(X1,sk1(X1)),trancl(r))
    | ~ member(pair(y,X1),trancl(r)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_trancl_2h5) ).

cnf(trans_trancl,axiom,
    trans(trancl(X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',trans_trancl) ).

cnf(diamond_trancl_2c1,negated_conjecture,
    member(pair(y,yp),trancl(r)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_trancl_2c1) ).

cnf(diamond_trancl_2c2,negated_conjecture,
    ( ~ member(pair(z,X1),trancl(r))
    | ~ member(pair(yp,X1),trancl(r)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_trancl_2c2) ).

cnf(diamond_strip_lemmaD1,axiom,
    ( member(pair(X4,diamond_strip_lemmaD_sk1(X2,X3,X4,X1)),trancl(X1))
    | ~ diamond(X1)
    | ~ member(pair(X2,X3),trancl(X1))
    | ~ member(pair(X2,X4),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_strip_lemmaD1) ).

cnf(diamond_trancl_2h1,hypothesis,
    diamond(r),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_trancl_2h1) ).

cnf(diamond_strip_lemmaD2,axiom,
    ( member(pair(X3,diamond_strip_lemmaD_sk1(X2,X3,X4,X1)),X1)
    | ~ diamond(X1)
    | ~ member(pair(X2,X3),trancl(X1))
    | ~ member(pair(X2,X4),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_strip_lemmaD2) ).

cnf(diamond_trancl_2h4,hypothesis,
    ( member(pair(ya,sk1(X1)),trancl(r))
    | ~ member(pair(y,X1),trancl(r)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_trancl_2h4) ).

cnf(diamond_trancl_2h3,hypothesis,
    member(pair(ya,z),r),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',diamond_trancl_2h3) ).

cnf(c_0_11,plain,
    ( member(pair(X2,X4),X1)
    | ~ trans(X1)
    | ~ member(pair(X2,X3),X1)
    | ~ member(pair(X3,X4),X1) ),
    inference(fof_simplification,[status(thm)],[transD]) ).

cnf(c_0_12,plain,
    ( member(pair(X1,X2),trancl(X3))
    | ~ member(pair(X1,X2),X3) ),
    inference(fof_simplification,[status(thm)],[r_into_trancl]) ).

cnf(c_0_13,hypothesis,
    ( member(pair(X1,sk1(X1)),trancl(r))
    | ~ member(pair(y,X1),trancl(r)) ),
    inference(fof_simplification,[status(thm)],[diamond_trancl_2h5]) ).

cnf(c_0_14,plain,
    ( member(pair(X2,X4),X1)
    | ~ trans(X1)
    | ~ member(pair(X2,X3),X1)
    | ~ member(pair(X3,X4),X1) ),
    c_0_11 ).

cnf(c_0_15,plain,
    ( member(pair(X1,X2),trancl(X3))
    | ~ member(pair(X1,X2),X3) ),
    c_0_12 ).

cnf(c_0_16,axiom,
    trans(trancl(X1)),
    trans_trancl ).

cnf(c_0_17,hypothesis,
    ( member(pair(X1,sk1(X1)),trancl(r))
    | ~ member(pair(y,X1),trancl(r)) ),
    c_0_13 ).

cnf(c_0_18,negated_conjecture,
    member(pair(y,yp),trancl(r)),
    diamond_trancl_2c1 ).

cnf(c_0_19,negated_conjecture,
    ( ~ member(pair(z,X1),trancl(r))
    | ~ member(pair(yp,X1),trancl(r)) ),
    inference(fof_simplification,[status(thm)],[diamond_trancl_2c2]) ).

cnf(c_0_20,plain,
    ( member(pair(X1,X2),trancl(X3))
    | ~ member(pair(X1,X4),trancl(X3))
    | ~ member(pair(X4,X2),X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).

cnf(c_0_21,negated_conjecture,
    member(pair(yp,sk1(yp)),trancl(r)),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    ( ~ member(pair(z,X1),trancl(r))
    | ~ member(pair(yp,X1),trancl(r)) ),
    c_0_19 ).

cnf(c_0_23,negated_conjecture,
    ( member(pair(yp,X1),trancl(r))
    | ~ member(pair(sk1(yp),X1),r) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_24,plain,
    ( member(pair(X4,diamond_strip_lemmaD_sk1(X2,X3,X4,X1)),trancl(X1))
    | ~ diamond(X1)
    | ~ member(pair(X2,X3),trancl(X1))
    | ~ member(pair(X2,X4),X1) ),
    inference(fof_simplification,[status(thm)],[diamond_strip_lemmaD1]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ member(pair(z,X1),trancl(r))
    | ~ member(pair(sk1(yp),X1),r) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,plain,
    ( member(pair(X4,diamond_strip_lemmaD_sk1(X2,X3,X4,X1)),trancl(X1))
    | ~ diamond(X1)
    | ~ member(pair(X2,X3),trancl(X1))
    | ~ member(pair(X2,X4),X1) ),
    c_0_24 ).

cnf(c_0_27,hypothesis,
    diamond(r),
    diamond_trancl_2h1 ).

cnf(c_0_28,plain,
    ( member(pair(X3,diamond_strip_lemmaD_sk1(X2,X3,X4,X1)),X1)
    | ~ diamond(X1)
    | ~ member(pair(X2,X3),trancl(X1))
    | ~ member(pair(X2,X4),X1) ),
    inference(fof_simplification,[status(thm)],[diamond_strip_lemmaD2]) ).

cnf(c_0_29,hypothesis,
    ( member(pair(ya,sk1(X1)),trancl(r))
    | ~ member(pair(y,X1),trancl(r)) ),
    inference(fof_simplification,[status(thm)],[diamond_trancl_2h4]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ member(pair(sk1(yp),diamond_strip_lemmaD_sk1(X1,X2,z,r)),r)
    | ~ member(pair(X1,X2),trancl(r))
    | ~ member(pair(X1,z),r) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).

cnf(c_0_31,plain,
    ( member(pair(X3,diamond_strip_lemmaD_sk1(X2,X3,X4,X1)),X1)
    | ~ diamond(X1)
    | ~ member(pair(X2,X3),trancl(X1))
    | ~ member(pair(X2,X4),X1) ),
    c_0_28 ).

cnf(c_0_32,hypothesis,
    ( member(pair(ya,sk1(X1)),trancl(r))
    | ~ member(pair(y,X1),trancl(r)) ),
    c_0_29 ).

cnf(c_0_33,negated_conjecture,
    ( ~ member(pair(X1,sk1(yp)),trancl(r))
    | ~ member(pair(X1,z),r) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_27])]) ).

cnf(c_0_34,negated_conjecture,
    member(pair(ya,sk1(yp)),trancl(r)),
    inference(spm,[status(thm)],[c_0_32,c_0_18]) ).

cnf(c_0_35,hypothesis,
    member(pair(ya,z),r),
    diamond_trancl_2h3 ).

cnf(c_0_36,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : COL100-2 : TPTP v8.2.0. Released v2.7.0.
% 0.12/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n003.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sat May 18 13:02:38 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.20/0.52  Running first-order model finding
% 0.20/0.52  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 8.55/1.62  # Version: 3.1.0
% 8.55/1.62  # Preprocessing class: FSLSSMSMSSSNFFN.
% 8.55/1.62  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.55/1.62  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.55/1.62  # Starting new_bool_3 with 300s (1) cores
% 8.55/1.62  # Starting new_bool_1 with 300s (1) cores
% 8.55/1.62  # Starting sh5l with 300s (1) cores
% 8.55/1.62  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 8982 completed with status 0
% 8.55/1.62  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 8.55/1.62  # Preprocessing class: FSLSSMSMSSSNFFN.
% 8.55/1.62  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.55/1.62  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.55/1.62  # No SInE strategy applied
% 8.55/1.62  # Search class: FGHSM-FFLS31-SFFFFFNN
% 8.55/1.62  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.55/1.62  # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 811s (1) cores
% 8.55/1.62  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 8.55/1.62  # Starting new_bool_3 with 136s (1) cores
% 8.55/1.62  # Starting new_bool_1 with 136s (1) cores
% 8.55/1.62  # Starting sh5l with 136s (1) cores
% 8.55/1.62  # G-E--_300_C01_F1_SE_CS_SP_S0Y with pid 8989 completed with status 0
% 8.55/1.62  # Result found by G-E--_300_C01_F1_SE_CS_SP_S0Y
% 8.55/1.62  # Preprocessing class: FSLSSMSMSSSNFFN.
% 8.55/1.62  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.55/1.62  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.55/1.62  # No SInE strategy applied
% 8.55/1.62  # Search class: FGHSM-FFLS31-SFFFFFNN
% 8.55/1.62  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.55/1.62  # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 811s (1) cores
% 8.55/1.62  # Preprocessing time       : 0.002 s
% 8.55/1.62  
% 8.55/1.62  # Proof found!
% 8.55/1.62  # SZS status Unsatisfiable
% 8.55/1.62  # SZS output start CNFRefutation
% See solution above
% 8.55/1.62  # Parsed axioms                        : 160
% 8.55/1.62  # Removed by relevancy pruning/SinE    : 0
% 8.55/1.62  # Initial clauses                      : 160
% 8.55/1.62  # Removed in clause preprocessing      : 4
% 8.55/1.62  # Initial clauses in saturation        : 156
% 8.55/1.62  # Processed clauses                    : 3433
% 8.55/1.62  # ...of these trivial                  : 358
% 8.55/1.62  # ...subsumed                          : 716
% 8.55/1.62  # ...remaining for further processing  : 2359
% 8.55/1.62  # Other redundant clauses eliminated   : 33
% 8.55/1.62  # Clauses deleted for lack of memory   : 0
% 8.55/1.62  # Backward-subsumed                    : 31
% 8.55/1.62  # Backward-rewritten                   : 57
% 8.55/1.62  # Generated clauses                    : 64387
% 8.55/1.62  # ...of the previous two non-redundant : 56357
% 8.55/1.62  # ...aggressively subsumed             : 0
% 8.55/1.62  # Contextual simplify-reflections      : 0
% 8.55/1.62  # Paramodulations                      : 64342
% 8.55/1.62  # Factorizations                       : 0
% 8.55/1.62  # NegExts                              : 0
% 8.55/1.62  # Equation resolutions                 : 45
% 8.55/1.62  # Disequality decompositions           : 0
% 8.55/1.62  # Total rewrite steps                  : 9151
% 8.55/1.62  # ...of those cached                   : 7589
% 8.55/1.62  # Propositional unsat checks           : 0
% 8.55/1.62  #    Propositional check models        : 0
% 8.55/1.62  #    Propositional check unsatisfiable : 0
% 8.55/1.62  #    Propositional clauses             : 0
% 8.55/1.62  #    Propositional clauses after purity: 0
% 8.55/1.62  #    Propositional unsat core size     : 0
% 8.55/1.62  #    Propositional preprocessing time  : 0.000
% 8.55/1.62  #    Propositional encoding time       : 0.000
% 8.55/1.62  #    Propositional solver time         : 0.000
% 8.55/1.62  #    Success case prop preproc time    : 0.000
% 8.55/1.62  #    Success case prop encoding time   : 0.000
% 8.55/1.62  #    Success case prop solver time     : 0.000
% 8.55/1.62  # Current number of processed clauses  : 2266
% 8.55/1.62  #    Positive orientable unit clauses  : 1428
% 8.55/1.62  #    Positive unorientable unit clauses: 0
% 8.55/1.62  #    Negative unit clauses             : 33
% 8.55/1.62  #    Non-unit-clauses                  : 805
% 8.55/1.62  # Current number of unprocessed clauses: 52892
% 8.55/1.62  # ...number of literals in the above   : 85981
% 8.55/1.62  # Current number of archived formulas  : 0
% 8.55/1.62  # Current number of archived clauses   : 88
% 8.55/1.62  # Clause-clause subsumption calls (NU) : 188872
% 8.55/1.62  # Rec. Clause-clause subsumption calls : 96513
% 8.55/1.62  # Non-unit clause-clause subsumptions  : 399
% 8.55/1.62  # Unit Clause-clause subsumption calls : 225056
% 8.55/1.62  # Rewrite failures with RHS unbound    : 0
% 8.55/1.62  # BW rewrite match attempts            : 47296
% 8.55/1.62  # BW rewrite match successes           : 40
% 8.55/1.62  # Condensation attempts                : 0
% 8.55/1.62  # Condensation successes               : 0
% 8.55/1.62  # Termbank termtop insertions          : 990632
% 8.55/1.62  # Search garbage collected termcells   : 327
% 8.55/1.62  
% 8.55/1.62  # -------------------------------------------------
% 8.55/1.62  # User time                : 1.031 s
% 8.55/1.62  # System time              : 0.051 s
% 8.55/1.62  # Total time               : 1.082 s
% 8.55/1.62  # Maximum resident set size: 2008 pages
% 8.55/1.62  
% 8.55/1.62  # -------------------------------------------------
% 8.55/1.62  # User time                : 5.304 s
% 8.55/1.62  # System time              : 0.099 s
% 8.55/1.62  # Total time               : 5.403 s
% 8.55/1.62  # Maximum resident set size: 1820 pages
% 8.55/1.62  % E---3.1 exiting
%------------------------------------------------------------------------------