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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : SYN299-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n022.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:46 EDT 2024

% Result   : Unsatisfiable 0.82s 0.58s
% Output   : CNFRefutation 0.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   31 (  14 unt;   0 nHn;  29 RR)
%            Number of literals    :   57 (   0 equ;  29 neg)
%            Maximal clause size   :    4 (   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   :   35 (   9 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(rule_125,axiom,
    ( s1(X1)
    | ~ p0(X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_125) ).

cnf(rule_002,axiom,
    ( l1(X1,X1)
    | ~ n0(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_002) ).

cnf(rule_189,axiom,
    ( s2(X1)
    | ~ q2(b,X1,b)
    | ~ s1(b) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_189) ).

cnf(axiom_14,axiom,
    p0(b,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).

cnf(rule_186,axiom,
    ( q2(X1,X1,X2)
    | ~ l1(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_186) ).

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

cnf(rule_273,axiom,
    ( s3(X1,X2)
    | ~ q2(X3,X1,X3)
    | ~ s2(X1)
    | ~ m0(X3,X4,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_273) ).

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

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

cnf(c_0_9,plain,
    ( s1(X1)
    | ~ p0(X1,X1) ),
    inference(fof_simplification,[status(thm)],[rule_125]) ).

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

cnf(c_0_11,plain,
    ( s2(X1)
    | ~ q2(b,X1,b)
    | ~ s1(b) ),
    inference(fof_simplification,[status(thm)],[rule_189]) ).

cnf(c_0_12,plain,
    ( s1(X1)
    | ~ p0(X1,X1) ),
    c_0_9 ).

cnf(c_0_13,axiom,
    p0(b,X1),
    axiom_14 ).

cnf(c_0_14,plain,
    ( q2(X1,X1,X2)
    | ~ l1(X2,X1) ),
    inference(fof_simplification,[status(thm)],[rule_186]) ).

cnf(c_0_15,plain,
    ( l1(X1,X1)
    | ~ n0(X2,X1) ),
    c_0_10 ).

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

cnf(c_0_17,plain,
    ( s2(X1)
    | ~ q2(b,X1,b)
    | ~ s1(b) ),
    c_0_11 ).

cnf(c_0_18,plain,
    s1(b),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_19,plain,
    ( q2(X1,X1,X2)
    | ~ l1(X2,X1) ),
    c_0_14 ).

cnf(c_0_20,plain,
    l1(b,b),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,plain,
    ( s3(X1,X2)
    | ~ q2(X3,X1,X3)
    | ~ s2(X1)
    | ~ m0(X3,X4,X2) ),
    inference(fof_simplification,[status(thm)],[rule_273]) ).

cnf(c_0_22,plain,
    ( s2(X1)
    | ~ q2(b,X1,b) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).

cnf(c_0_23,plain,
    q2(b,b,b),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,plain,
    ( s3(X1,X2)
    | ~ q2(X3,X1,X3)
    | ~ s2(X1)
    | ~ m0(X3,X4,X2) ),
    c_0_21 ).

cnf(c_0_25,plain,
    s2(b),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,negated_conjecture,
    ~ s3(b,a),
    inference(fof_simplification,[status(thm)],[prove_this]) ).

cnf(c_0_27,plain,
    ( s3(b,X1)
    | ~ m0(b,X2,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_23]),c_0_25])]) ).

cnf(c_0_28,axiom,
    m0(b,a,a),
    axiom_38 ).

cnf(c_0_29,negated_conjecture,
    ~ s3(b,a),
    c_0_26 ).

cnf(c_0_30,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYN299-1 : TPTP v8.2.0. Released v1.1.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n022.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon May 20 15:53:53 EDT 2024
% 0.13/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.82/0.58  # Version: 3.1.0
% 0.82/0.58  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.82/0.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.58  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.82/0.58  # Starting new_bool_3 with 300s (1) cores
% 0.82/0.58  # Starting new_bool_1 with 300s (1) cores
% 0.82/0.58  # Starting sh5l with 300s (1) cores
% 0.82/0.58  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 8690 completed with status 0
% 0.82/0.58  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.82/0.58  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.82/0.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.58  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.82/0.58  # No SInE strategy applied
% 0.82/0.58  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.82/0.58  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.82/0.58  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.82/0.58  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.82/0.58  # Starting new_bool_3 with 136s (1) cores
% 0.82/0.58  # Starting new_bool_1 with 136s (1) cores
% 0.82/0.58  # Starting sh5l with 136s (1) cores
% 0.82/0.58  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 8696 completed with status 0
% 0.82/0.58  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.82/0.58  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.82/0.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.58  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.82/0.58  # No SInE strategy applied
% 0.82/0.58  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.82/0.58  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.82/0.58  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.82/0.58  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.82/0.58  # Preprocessing time       : 0.005 s
% 0.82/0.58  # Presaturation interreduction done
% 0.82/0.58  
% 0.82/0.58  # Proof found!
% 0.82/0.58  # SZS status Unsatisfiable
% 0.82/0.58  # SZS output start CNFRefutation
% See solution above
% 0.82/0.58  # Parsed axioms                        : 369
% 0.82/0.58  # Removed by relevancy pruning/SinE    : 0
% 0.82/0.58  # Initial clauses                      : 369
% 0.82/0.58  # Removed in clause preprocessing      : 7
% 0.82/0.58  # Initial clauses in saturation        : 362
% 0.82/0.58  # Processed clauses                    : 1037
% 0.82/0.58  # ...of these trivial                  : 93
% 0.82/0.58  # ...subsumed                          : 28
% 0.82/0.58  # ...remaining for further processing  : 916
% 0.82/0.58  # Other redundant clauses eliminated   : 0
% 0.82/0.58  # Clauses deleted for lack of memory   : 0
% 0.82/0.58  # Backward-subsumed                    : 18
% 0.82/0.58  # Backward-rewritten                   : 115
% 0.82/0.58  # Generated clauses                    : 1203
% 0.82/0.58  # ...of the previous two non-redundant : 997
% 0.82/0.58  # ...aggressively subsumed             : 0
% 0.82/0.58  # Contextual simplify-reflections      : 3
% 0.82/0.58  # Paramodulations                      : 1203
% 0.82/0.58  # Factorizations                       : 0
% 0.82/0.58  # NegExts                              : 0
% 0.82/0.58  # Equation resolutions                 : 0
% 0.82/0.58  # Disequality decompositions           : 0
% 0.82/0.58  # Total rewrite steps                  : 622
% 0.82/0.58  # ...of those cached                   : 452
% 0.82/0.58  # Propositional unsat checks           : 0
% 0.82/0.58  #    Propositional check models        : 0
% 0.82/0.58  #    Propositional check unsatisfiable : 0
% 0.82/0.58  #    Propositional clauses             : 0
% 0.82/0.58  #    Propositional clauses after purity: 0
% 0.82/0.58  #    Propositional unsat core size     : 0
% 0.82/0.58  #    Propositional preprocessing time  : 0.000
% 0.82/0.58  #    Propositional encoding time       : 0.000
% 0.82/0.58  #    Propositional solver time         : 0.000
% 0.82/0.58  #    Success case prop preproc time    : 0.000
% 0.82/0.58  #    Success case prop encoding time   : 0.000
% 0.82/0.58  #    Success case prop solver time     : 0.000
% 0.82/0.58  # Current number of processed clauses  : 455
% 0.82/0.58  #    Positive orientable unit clauses  : 140
% 0.82/0.58  #    Positive unorientable unit clauses: 0
% 0.82/0.58  #    Negative unit clauses             : 1
% 0.82/0.58  #    Non-unit-clauses                  : 314
% 0.82/0.58  # Current number of unprocessed clauses: 606
% 0.82/0.58  # ...number of literals in the above   : 1537
% 0.82/0.58  # Current number of archived formulas  : 0
% 0.82/0.58  # Current number of archived clauses   : 461
% 0.82/0.58  # Clause-clause subsumption calls (NU) : 54318
% 0.82/0.58  # Rec. Clause-clause subsumption calls : 36766
% 0.82/0.58  # Non-unit clause-clause subsumptions  : 45
% 0.82/0.58  # Unit Clause-clause subsumption calls : 1449
% 0.82/0.58  # Rewrite failures with RHS unbound    : 0
% 0.82/0.58  # BW rewrite match attempts            : 166
% 0.82/0.58  # BW rewrite match successes           : 85
% 0.82/0.58  # Condensation attempts                : 0
% 0.82/0.58  # Condensation successes               : 0
% 0.82/0.58  # Termbank termtop insertions          : 26307
% 0.82/0.58  # Search garbage collected termcells   : 1461
% 0.82/0.58  
% 0.82/0.58  # -------------------------------------------------
% 0.82/0.58  # User time                : 0.080 s
% 0.82/0.58  # System time              : 0.011 s
% 0.82/0.58  # Total time               : 0.091 s
% 0.82/0.58  # Maximum resident set size: 2640 pages
% 0.82/0.58  
% 0.82/0.58  # -------------------------------------------------
% 0.82/0.58  # User time                : 0.394 s
% 0.82/0.58  # System time              : 0.024 s
% 0.82/0.58  # Total time               : 0.418 s
% 0.82/0.58  # Maximum resident set size: 2020 pages
% 0.82/0.58  % E---3.1 exiting
%------------------------------------------------------------------------------