TSTP Solution File: SYN672-1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SYN672-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n011.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 20:33:22 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
cnf(p9_42,negated_conjecture,
    ( p9(f10(X1,X2),f10(X3,X4))
    | ~ p3(X2,X4)
    | ~ p8(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.842BMKAZRR/E---3.1_25308.p',p9_42) ).

cnf(p3_37,negated_conjecture,
    p3(f4(f7(c34,X1),f14(c38,X2)),f14(X1,X2)),
    file('/export/starexec/sandbox2/tmp/tmp.842BMKAZRR/E---3.1_25308.p',p3_37) ).

cnf(p30_39,negated_conjecture,
    ( p30(X1,X2)
    | ~ p30(X3,X4)
    | ~ p9(X3,X1)
    | ~ p3(X4,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.842BMKAZRR/E---3.1_25308.p',p30_39) ).

cnf(p3_6,negated_conjecture,
    p3(X1,X1),
    file('/export/starexec/sandbox2/tmp/tmp.842BMKAZRR/E---3.1_25308.p',p3_6) ).

cnf(p8_3,negated_conjecture,
    p8(X1,X1),
    file('/export/starexec/sandbox2/tmp/tmp.842BMKAZRR/E---3.1_25308.p',p8_3) ).

cnf(p3_53,negated_conjecture,
    ( p3(X1,f14(c38,X2))
    | p30(f10(f12(c32,c33),f14(c38,X2)),X1)
    | ~ p31(f20(c36,X2),f17(c37,X1)) ),
    file('/export/starexec/sandbox2/tmp/tmp.842BMKAZRR/E---3.1_25308.p',p3_53) ).

cnf(p31_19,negated_conjecture,
    p31(f20(c36,c39),f17(c37,c40)),
    file('/export/starexec/sandbox2/tmp/tmp.842BMKAZRR/E---3.1_25308.p',p31_19) ).

cnf(not_p3_18,negated_conjecture,
    ~ p3(c40,f14(c38,c39)),
    file('/export/starexec/sandbox2/tmp/tmp.842BMKAZRR/E---3.1_25308.p',not_p3_18) ).

cnf(p30_54,negated_conjecture,
    ( p30(f10(f12(c32,c33),f4(f7(c34,c35),X1)),f4(f7(c34,c35),X2))
    | ~ p30(f10(f12(c32,c33),X1),X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.842BMKAZRR/E---3.1_25308.p',p30_54) ).

cnf(not_p30_40,negated_conjecture,
    ~ p30(f10(f12(c32,c33),f14(c35,c39)),f4(f7(c34,c35),c40)),
    file('/export/starexec/sandbox2/tmp/tmp.842BMKAZRR/E---3.1_25308.p',not_p30_40) ).

cnf(c_0_10,negated_conjecture,
    ( p9(f10(X1,X2),f10(X3,X4))
    | ~ p3(X2,X4)
    | ~ p8(X1,X3) ),
    p9_42 ).

cnf(c_0_11,negated_conjecture,
    p3(f4(f7(c34,X1),f14(c38,X2)),f14(X1,X2)),
    p3_37 ).

cnf(c_0_12,negated_conjecture,
    ( p30(X1,X2)
    | ~ p30(X3,X4)
    | ~ p9(X3,X1)
    | ~ p3(X4,X2) ),
    p30_39 ).

cnf(c_0_13,negated_conjecture,
    p3(X1,X1),
    p3_6 ).

cnf(c_0_14,negated_conjecture,
    ( p9(f10(X1,f4(f7(c34,X2),f14(c38,X3))),f10(X4,f14(X2,X3)))
    | ~ p8(X1,X4) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,negated_conjecture,
    p8(X1,X1),
    p8_3 ).

cnf(c_0_16,negated_conjecture,
    ( p3(X1,f14(c38,X2))
    | p30(f10(f12(c32,c33),f14(c38,X2)),X1)
    | ~ p31(f20(c36,X2),f17(c37,X1)) ),
    p3_53 ).

cnf(c_0_17,negated_conjecture,
    p31(f20(c36,c39),f17(c37,c40)),
    p31_19 ).

cnf(c_0_18,negated_conjecture,
    ~ p3(c40,f14(c38,c39)),
    not_p3_18 ).

cnf(c_0_19,negated_conjecture,
    ( p30(X1,X2)
    | ~ p30(X3,X2)
    | ~ p9(X3,X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_20,negated_conjecture,
    p9(f10(X1,f4(f7(c34,X2),f14(c38,X3))),f10(X1,f14(X2,X3))),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_21,negated_conjecture,
    ( p30(f10(f12(c32,c33),f4(f7(c34,c35),X1)),f4(f7(c34,c35),X2))
    | ~ p30(f10(f12(c32,c33),X1),X2) ),
    p30_54 ).

cnf(c_0_22,negated_conjecture,
    p30(f10(f12(c32,c33),f14(c38,c39)),c40),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).

cnf(c_0_23,negated_conjecture,
    ( p30(f10(X1,f14(X2,X3)),X4)
    | ~ p30(f10(X1,f4(f7(c34,X2),f14(c38,X3))),X4) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,negated_conjecture,
    p30(f10(f12(c32,c33),f4(f7(c34,c35),f14(c38,c39))),f4(f7(c34,c35),c40)),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_25,negated_conjecture,
    ~ p30(f10(f12(c32,c33),f14(c35,c39)),f4(f7(c34,c35),c40)),
    not_p30_40 ).

cnf(c_0_26,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : SYN672-1 : TPTP v8.1.2. Released v2.5.0.
% 0.04/0.14  % Command    : run_E %s %d THM
% 0.14/0.34  % Computer : n011.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 2400
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Mon Oct  2 18:32:38 EDT 2023
% 0.14/0.34  % CPUTime    : 
% 0.20/0.48  Running first-order model finding
% 0.20/0.48  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.842BMKAZRR/E---3.1_25308.p
% 0.20/0.53  # Version: 3.1pre001
% 0.20/0.53  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.53  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53  # Starting sh5l with 300s (1) cores
% 0.20/0.53  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 25445 completed with status 0
% 0.20/0.53  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.20/0.53  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.53  # No SInE strategy applied
% 0.20/0.53  # Search class: FGUNM-FFMF22-MFFFFFNN
% 0.20/0.53  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.53  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.20/0.53  # Starting new_bool_3 with 136s (1) cores
% 0.20/0.53  # Starting new_bool_1 with 136s (1) cores
% 0.20/0.53  # Starting sh5l with 136s (1) cores
% 0.20/0.53  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 25450 completed with status 0
% 0.20/0.53  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.20/0.53  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.53  # No SInE strategy applied
% 0.20/0.53  # Search class: FGUNM-FFMF22-MFFFFFNN
% 0.20/0.53  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.53  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.20/0.53  # Preprocessing time       : 0.002 s
% 0.20/0.53  # Presaturation interreduction done
% 0.20/0.53  
% 0.20/0.53  # Proof found!
% 0.20/0.53  # SZS status Unsatisfiable
% 0.20/0.53  # SZS output start CNFRefutation
% See solution above
% 0.20/0.53  # Parsed axioms                        : 54
% 0.20/0.53  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.53  # Initial clauses                      : 54
% 0.20/0.53  # Removed in clause preprocessing      : 0
% 0.20/0.53  # Initial clauses in saturation        : 54
% 0.20/0.53  # Processed clauses                    : 222
% 0.20/0.53  # ...of these trivial                  : 0
% 0.20/0.53  # ...subsumed                          : 0
% 0.20/0.53  # ...remaining for further processing  : 222
% 0.20/0.53  # Other redundant clauses eliminated   : 0
% 0.20/0.53  # Clauses deleted for lack of memory   : 0
% 0.20/0.53  # Backward-subsumed                    : 0
% 0.20/0.53  # Backward-rewritten                   : 0
% 0.20/0.53  # Generated clauses                    : 213
% 0.20/0.53  # ...of the previous two non-redundant : 152
% 0.20/0.53  # ...aggressively subsumed             : 0
% 0.20/0.53  # Contextual simplify-reflections      : 0
% 0.20/0.53  # Paramodulations                      : 213
% 0.20/0.53  # Factorizations                       : 0
% 0.20/0.53  # NegExts                              : 0
% 0.20/0.53  # Equation resolutions                 : 0
% 0.20/0.53  # Total rewrite steps                  : 58
% 0.20/0.53  # Propositional unsat checks           : 0
% 0.20/0.53  #    Propositional check models        : 0
% 0.20/0.53  #    Propositional check unsatisfiable : 0
% 0.20/0.53  #    Propositional clauses             : 0
% 0.20/0.53  #    Propositional clauses after purity: 0
% 0.20/0.53  #    Propositional unsat core size     : 0
% 0.20/0.53  #    Propositional preprocessing time  : 0.000
% 0.20/0.53  #    Propositional encoding time       : 0.000
% 0.20/0.53  #    Propositional solver time         : 0.000
% 0.20/0.53  #    Success case prop preproc time    : 0.000
% 0.20/0.53  #    Success case prop encoding time   : 0.000
% 0.20/0.53  #    Success case prop solver time     : 0.000
% 0.20/0.53  # Current number of processed clauses  : 168
% 0.20/0.53  #    Positive orientable unit clauses  : 85
% 0.20/0.53  #    Positive unorientable unit clauses: 0
% 0.20/0.53  #    Negative unit clauses             : 2
% 0.20/0.53  #    Non-unit-clauses                  : 81
% 0.20/0.53  # Current number of unprocessed clauses: 38
% 0.20/0.53  # ...number of literals in the above   : 63
% 0.20/0.53  # Current number of archived formulas  : 0
% 0.20/0.53  # Current number of archived clauses   : 54
% 0.20/0.53  # Clause-clause subsumption calls (NU) : 1325
% 0.20/0.53  # Rec. Clause-clause subsumption calls : 1263
% 0.20/0.53  # Non-unit clause-clause subsumptions  : 0
% 0.20/0.53  # Unit Clause-clause subsumption calls : 8
% 0.20/0.53  # Rewrite failures with RHS unbound    : 0
% 0.20/0.53  # BW rewrite match attempts            : 1279
% 0.20/0.53  # BW rewrite match successes           : 0
% 0.20/0.53  # Condensation attempts                : 0
% 0.20/0.53  # Condensation successes               : 0
% 0.20/0.53  # Termbank termtop insertions          : 16629
% 0.20/0.53  
% 0.20/0.53  # -------------------------------------------------
% 0.20/0.53  # User time                : 0.035 s
% 0.20/0.53  # System time              : 0.007 s
% 0.20/0.53  # Total time               : 0.042 s
% 0.20/0.53  # Maximum resident set size: 1732 pages
% 0.20/0.53  
% 0.20/0.53  # -------------------------------------------------
% 0.20/0.53  # User time                : 0.195 s
% 0.20/0.53  # System time              : 0.014 s
% 0.20/0.53  # Total time               : 0.209 s
% 0.20/0.53  # Maximum resident set size: 1732 pages
% 0.20/0.53  % E---3.1 exiting
%------------------------------------------------------------------------------