TSTP Solution File: SYN224-1 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : SYN224-1 : TPTP v8.2.0. Released v1.1.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 : Tue May 21 07:57:31 EDT 2024

% Result   : Unsatisfiable 0.20s 0.52s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   34 (  15 unt;   0 nHn;  34 RR)
%            Number of literals    :   59 (   0 equ;  28 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   22 (  12 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(rule_001,axiom,
    ( k1(X1)
    | ~ n0(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).

cnf(rule_088,axiom,
    ( p1(a,a,a)
    | ~ l0(a) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_088) ).

cnf(rule_136,axiom,
    ( m2(b)
    | ~ k1(b) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_136) ).

cnf(axiom_15,axiom,
    n0(a,b),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_15) ).

cnf(rule_087,axiom,
    ( p1(a,b,a)
    | ~ r0(b)
    | ~ p1(a,a,a) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_087) ).

cnf(axiom_20,axiom,
    l0(a),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_20) ).

cnf(rule_217,axiom,
    ( l3(X1,X1)
    | ~ n2(X1)
    | ~ m2(b) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_217) ).

cnf(rule_137,axiom,
    ( n2(X1)
    | ~ p1(X2,X3,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_137) ).

cnf(axiom_9,axiom,
    r0(b),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_9) ).

cnf(prove_this,negated_conjecture,
    ~ l3(a,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

cnf(c_0_10,plain,
    ( k1(X1)
    | ~ n0(X2,X1) ),
    inference(fof_simplification,[status(thm)],[rule_001]) ).

cnf(c_0_11,plain,
    ( p1(a,a,a)
    | ~ l0(a) ),
    inference(fof_simplification,[status(thm)],[rule_088]) ).

cnf(c_0_12,plain,
    ( m2(b)
    | ~ k1(b) ),
    inference(fof_simplification,[status(thm)],[rule_136]) ).

cnf(c_0_13,plain,
    ( k1(X1)
    | ~ n0(X2,X1) ),
    c_0_10 ).

cnf(c_0_14,axiom,
    n0(a,b),
    axiom_15 ).

cnf(c_0_15,plain,
    ( p1(a,b,a)
    | ~ r0(b)
    | ~ p1(a,a,a) ),
    inference(fof_simplification,[status(thm)],[rule_087]) ).

cnf(c_0_16,plain,
    ( p1(a,a,a)
    | ~ l0(a) ),
    c_0_11 ).

cnf(c_0_17,axiom,
    l0(a),
    axiom_20 ).

cnf(c_0_18,plain,
    ( l3(X1,X1)
    | ~ n2(X1)
    | ~ m2(b) ),
    inference(fof_simplification,[status(thm)],[rule_217]) ).

cnf(c_0_19,plain,
    ( m2(b)
    | ~ k1(b) ),
    c_0_12 ).

cnf(c_0_20,plain,
    k1(b),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_21,plain,
    ( n2(X1)
    | ~ p1(X2,X3,X1) ),
    inference(fof_simplification,[status(thm)],[rule_137]) ).

cnf(c_0_22,plain,
    ( p1(a,b,a)
    | ~ r0(b)
    | ~ p1(a,a,a) ),
    c_0_15 ).

cnf(c_0_23,axiom,
    r0(b),
    axiom_9 ).

cnf(c_0_24,plain,
    p1(a,a,a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).

cnf(c_0_25,negated_conjecture,
    ~ l3(a,X1),
    inference(fof_simplification,[status(thm)],[prove_this]) ).

cnf(c_0_26,plain,
    ( l3(X1,X1)
    | ~ n2(X1)
    | ~ m2(b) ),
    c_0_18 ).

cnf(c_0_27,plain,
    m2(b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).

cnf(c_0_28,plain,
    ( n2(X1)
    | ~ p1(X2,X3,X1) ),
    c_0_21 ).

cnf(c_0_29,plain,
    p1(a,b,a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).

cnf(c_0_30,negated_conjecture,
    ~ l3(a,X1),
    c_0_25 ).

cnf(c_0_31,plain,
    ( l3(X1,X1)
    | ~ n2(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).

cnf(c_0_32,plain,
    n2(a),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYN224-1 : TPTP v8.2.0. Released v1.1.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.15/0.34  % Computer : n003.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit   : 300
% 0.15/0.34  % WCLimit    : 300
% 0.15/0.34  % DateTime   : Mon May 20 13:52:37 EDT 2024
% 0.15/0.34  % CPUTime    : 
% 0.20/0.47  Running first-order model finding
% 0.20/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.20/0.52  # Version: 3.1.0
% 0.20/0.52  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52  # Starting sh5l with 300s (1) cores
% 0.20/0.52  # new_bool_3 with pid 1375 completed with status 0
% 0.20/0.52  # Result found by new_bool_3
% 0.20/0.52  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.20/0.52  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.52  # SAT001_MinMin_p005000_rr_RG with pid 1382 completed with status 0
% 0.20/0.52  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.52  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.20/0.52  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.52  # Preprocessing time       : 0.004 s
% 0.20/0.52  # Presaturation interreduction done
% 0.20/0.52  
% 0.20/0.52  # Proof found!
% 0.20/0.52  # SZS status Unsatisfiable
% 0.20/0.52  # SZS output start CNFRefutation
% See solution above
% 0.20/0.52  # Parsed axioms                        : 369
% 0.20/0.52  # Removed by relevancy pruning/SinE    : 30
% 0.20/0.52  # Initial clauses                      : 339
% 0.20/0.52  # Removed in clause preprocessing      : 6
% 0.20/0.52  # Initial clauses in saturation        : 333
% 0.20/0.52  # Processed clauses                    : 457
% 0.20/0.52  # ...of these trivial                  : 13
% 0.20/0.52  # ...subsumed                          : 22
% 0.20/0.52  # ...remaining for further processing  : 422
% 0.20/0.52  # Other redundant clauses eliminated   : 0
% 0.20/0.52  # Clauses deleted for lack of memory   : 0
% 0.20/0.52  # Backward-subsumed                    : 5
% 0.20/0.52  # Backward-rewritten                   : 16
% 0.20/0.52  # Generated clauses                    : 67
% 0.20/0.52  # ...of the previous two non-redundant : 62
% 0.20/0.52  # ...aggressively subsumed             : 0
% 0.20/0.52  # Contextual simplify-reflections      : 2
% 0.20/0.52  # Paramodulations                      : 67
% 0.20/0.52  # Factorizations                       : 0
% 0.20/0.52  # NegExts                              : 0
% 0.20/0.52  # Equation resolutions                 : 0
% 0.20/0.52  # Disequality decompositions           : 0
% 0.20/0.52  # Total rewrite steps                  : 102
% 0.20/0.52  # ...of those cached                   : 53
% 0.20/0.52  # Propositional unsat checks           : 0
% 0.20/0.52  #    Propositional check models        : 0
% 0.20/0.52  #    Propositional check unsatisfiable : 0
% 0.20/0.52  #    Propositional clauses             : 0
% 0.20/0.52  #    Propositional clauses after purity: 0
% 0.20/0.52  #    Propositional unsat core size     : 0
% 0.20/0.52  #    Propositional preprocessing time  : 0.000
% 0.20/0.52  #    Propositional encoding time       : 0.000
% 0.20/0.52  #    Propositional solver time         : 0.000
% 0.20/0.52  #    Success case prop preproc time    : 0.000
% 0.20/0.52  #    Success case prop encoding time   : 0.000
% 0.20/0.52  #    Success case prop solver time     : 0.000
% 0.20/0.52  # Current number of processed clauses  : 102
% 0.20/0.52  #    Positive orientable unit clauses  : 64
% 0.20/0.52  #    Positive unorientable unit clauses: 0
% 0.20/0.52  #    Negative unit clauses             : 2
% 0.20/0.52  #    Non-unit-clauses                  : 36
% 0.20/0.52  # Current number of unprocessed clauses: 234
% 0.20/0.52  # ...number of literals in the above   : 694
% 0.20/0.52  # Current number of archived formulas  : 0
% 0.20/0.52  # Current number of archived clauses   : 320
% 0.20/0.52  # Clause-clause subsumption calls (NU) : 19578
% 0.20/0.52  # Rec. Clause-clause subsumption calls : 12666
% 0.20/0.52  # Non-unit clause-clause subsumptions  : 28
% 0.20/0.52  # Unit Clause-clause subsumption calls : 59
% 0.20/0.52  # Rewrite failures with RHS unbound    : 0
% 0.20/0.52  # BW rewrite match attempts            : 15
% 0.20/0.52  # BW rewrite match successes           : 14
% 0.20/0.52  # Condensation attempts                : 0
% 0.20/0.52  # Condensation successes               : 0
% 0.20/0.52  # Termbank termtop insertions          : 12599
% 0.20/0.52  # Search garbage collected termcells   : 1503
% 0.20/0.52  
% 0.20/0.52  # -------------------------------------------------
% 0.20/0.52  # User time                : 0.027 s
% 0.20/0.52  # System time              : 0.005 s
% 0.20/0.52  # Total time               : 0.032 s
% 0.20/0.52  # Maximum resident set size: 2632 pages
% 0.20/0.52  
% 0.20/0.52  # -------------------------------------------------
% 0.20/0.52  # User time                : 0.032 s
% 0.20/0.52  # System time              : 0.008 s
% 0.20/0.52  # Total time               : 0.040 s
% 0.20/0.52  # Maximum resident set size: 2020 pages
% 0.20/0.52  % E---3.1 exiting
%------------------------------------------------------------------------------