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

View Problem - Process Solution

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

% Computer : n010.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 : Sat May  4 10:19:46 EDT 2024

% Result   : Unsatisfiable 0.19s 0.54s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   19 (  10 unt;   0 nHn;  19 RR)
%            Number of literals    :   31 (   0 equ;  15 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :    9 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(rule_088,axiom,
    ( p1(a,a,a)
    | ~ l0(a) ),
    file('/export/starexec/sandbox2/tmp/tmp.t7KkINc0u0/E---3.1_20195.p',rule_088) ).

cnf(rule_087,axiom,
    ( p1(a,b,a)
    | ~ r0(b)
    | ~ p1(a,a,a) ),
    file('/export/starexec/sandbox2/tmp/tmp.t7KkINc0u0/E---3.1_20195.p',rule_087) ).

cnf(axiom_20,axiom,
    l0(a),
    file('/export/starexec/sandbox2/tmp/tmp.t7KkINc0u0/E---3.1_20195.p',axiom_20) ).

cnf(rule_137,axiom,
    ( n2(X1)
    | ~ p1(X2,X3,X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.t7KkINc0u0/E---3.1_20195.p',rule_137) ).

cnf(axiom_9,axiom,
    r0(b),
    file('/export/starexec/sandbox2/tmp/tmp.t7KkINc0u0/E---3.1_20195.p',axiom_9) ).

cnf(prove_this,negated_conjecture,
    ~ n2(a),
    file('/export/starexec/sandbox2/tmp/tmp.t7KkINc0u0/E---3.1_20195.p',prove_this) ).

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

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

cnf(c_0_8,plain,
    ( p1(a,a,a)
    | ~ l0(a) ),
    c_0_6 ).

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

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

cnf(c_0_11,plain,
    ( p1(a,b,a)
    | ~ r0(b)
    | ~ p1(a,a,a) ),
    c_0_7 ).

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

cnf(c_0_13,plain,
    p1(a,a,a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).

cnf(c_0_14,negated_conjecture,
    ~ n2(a),
    inference(fof_simplification,[status(thm)],[prove_this]) ).

cnf(c_0_15,plain,
    ( n2(X1)
    | ~ p1(X2,X3,X1) ),
    c_0_10 ).

cnf(c_0_16,plain,
    p1(a,b,a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).

cnf(c_0_17,negated_conjecture,
    ~ n2(a),
    c_0_14 ).

cnf(c_0_18,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN255-1 : TPTP v8.1.2. Released v1.1.0.
% 0.12/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n010.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   : Fri May  3 10:22:48 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.19/0.49  Running first-order model finding
% 0.19/0.49  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/tmp/tmp.t7KkINc0u0/E---3.1_20195.p
% 0.19/0.54  # Version: 3.1.0
% 0.19/0.54  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.54  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.54  # Starting sh5l with 300s (1) cores
% 0.19/0.54  # new_bool_3 with pid 20273 completed with status 0
% 0.19/0.54  # Result found by new_bool_3
% 0.19/0.54  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.54  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.54  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.19/0.54  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.54  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.54  # SAT001_MinMin_p005000_rr_RG with pid 20276 completed with status 0
% 0.19/0.54  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.54  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.54  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.54  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.19/0.54  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.54  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.54  # Preprocessing time       : 0.005 s
% 0.19/0.54  # Presaturation interreduction done
% 0.19/0.54  
% 0.19/0.54  # Proof found!
% 0.19/0.54  # SZS status Unsatisfiable
% 0.19/0.54  # SZS output start CNFRefutation
% See solution above
% 0.19/0.54  # Parsed axioms                        : 369
% 0.19/0.54  # Removed by relevancy pruning/SinE    : 41
% 0.19/0.54  # Initial clauses                      : 328
% 0.19/0.54  # Removed in clause preprocessing      : 5
% 0.19/0.54  # Initial clauses in saturation        : 323
% 0.19/0.54  # Processed clauses                    : 372
% 0.19/0.54  # ...of these trivial                  : 8
% 0.19/0.54  # ...subsumed                          : 22
% 0.19/0.54  # ...remaining for further processing  : 342
% 0.19/0.54  # Other redundant clauses eliminated   : 0
% 0.19/0.54  # Clauses deleted for lack of memory   : 0
% 0.19/0.54  # Backward-subsumed                    : 2
% 0.19/0.54  # Backward-rewritten                   : 4
% 0.19/0.54  # Generated clauses                    : 11
% 0.19/0.54  # ...of the previous two non-redundant : 8
% 0.19/0.54  # ...aggressively subsumed             : 0
% 0.19/0.54  # Contextual simplify-reflections      : 1
% 0.19/0.54  # Paramodulations                      : 11
% 0.19/0.54  # Factorizations                       : 0
% 0.19/0.54  # NegExts                              : 0
% 0.19/0.54  # Equation resolutions                 : 0
% 0.19/0.54  # Disequality decompositions           : 0
% 0.19/0.54  # Total rewrite steps                  : 74
% 0.19/0.54  # ...of those cached                   : 39
% 0.19/0.54  # Propositional unsat checks           : 0
% 0.19/0.54  #    Propositional check models        : 0
% 0.19/0.54  #    Propositional check unsatisfiable : 0
% 0.19/0.54  #    Propositional clauses             : 0
% 0.19/0.54  #    Propositional clauses after purity: 0
% 0.19/0.54  #    Propositional unsat core size     : 0
% 0.19/0.54  #    Propositional preprocessing time  : 0.000
% 0.19/0.54  #    Propositional encoding time       : 0.000
% 0.19/0.54  #    Propositional solver time         : 0.000
% 0.19/0.54  #    Success case prop preproc time    : 0.000
% 0.19/0.54  #    Success case prop encoding time   : 0.000
% 0.19/0.54  #    Success case prop solver time     : 0.000
% 0.19/0.54  # Current number of processed clauses  : 47
% 0.19/0.54  #    Positive orientable unit clauses  : 37
% 0.19/0.54  #    Positive unorientable unit clauses: 0
% 0.19/0.54  #    Negative unit clauses             : 1
% 0.19/0.54  #    Non-unit-clauses                  : 9
% 0.19/0.54  # Current number of unprocessed clauses: 248
% 0.19/0.54  # ...number of literals in the above   : 721
% 0.19/0.54  # Current number of archived formulas  : 0
% 0.19/0.54  # Current number of archived clauses   : 295
% 0.19/0.54  # Clause-clause subsumption calls (NU) : 17505
% 0.19/0.54  # Rec. Clause-clause subsumption calls : 11618
% 0.19/0.54  # Non-unit clause-clause subsumptions  : 25
% 0.19/0.54  # Unit Clause-clause subsumption calls : 26
% 0.19/0.54  # Rewrite failures with RHS unbound    : 0
% 0.19/0.54  # BW rewrite match attempts            : 5
% 0.19/0.54  # BW rewrite match successes           : 4
% 0.19/0.54  # Condensation attempts                : 0
% 0.19/0.54  # Condensation successes               : 0
% 0.19/0.54  # Termbank termtop insertions          : 11708
% 0.19/0.54  # Search garbage collected termcells   : 1515
% 0.19/0.54  
% 0.19/0.54  # -------------------------------------------------
% 0.19/0.54  # User time                : 0.030 s
% 0.19/0.54  # System time              : 0.006 s
% 0.19/0.54  # Total time               : 0.037 s
% 0.19/0.54  # Maximum resident set size: 2616 pages
% 0.19/0.54  
% 0.19/0.54  # -------------------------------------------------
% 0.19/0.54  # User time                : 0.036 s
% 0.19/0.54  # System time              : 0.009 s
% 0.19/0.54  # Total time               : 0.045 s
% 0.19/0.54  # Maximum resident set size: 2016 pages
% 0.19/0.54  % E---3.1 exiting
%------------------------------------------------------------------------------