TSTP Solution File: SYN335+1 by E-SAT---3.2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.2.0
% Problem  : SYN335+1 : TPTP v8.2.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d SAT

% Computer : n021.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 Jun 24 19:24:08 EDT 2024

% Result   : CounterSatisfiable 0.21s 0.51s
% Output   : Saturation 0.21s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_5)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_3,negated_conjecture,
    ( big_g(X1,X2)
    | ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_2]),
    [final] ).

cnf(c_0_4,negated_conjecture,
    ( big_f(esk1_2(X1,X2),esk1_2(X1,X2))
    | big_f(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]),
    [final] ).

cnf(c_0_6,negated_conjecture,
    ( big_g(X1,X2)
    | big_f(X1,X2) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]),
    [final] ).

cnf(c_0_7,negated_conjecture,
    ( big_f(X1,X2)
    | ~ big_g(X1,esk1_2(X2,X1))
    | ~ big_g(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]),
    [final] ).

cnf(c_0_9,negated_conjecture,
    ( big_g(esk1_2(X1,X2),esk1_2(X1,X2))
    | ~ big_f(X1,X2) ),
    inference(csr,[status(thm)],[c_0_5,c_0_6]),
    [final] ).

cnf(c_0_10,negated_conjecture,
    ( big_f(X1,esk1_2(X2,X1))
    | big_f(X1,X2)
    | ~ big_g(X2,X1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_6]),
    [final] ).

cnf(c_0_11,negated_conjecture,
    ( big_f(esk1_2(X1,X2),esk1_2(X1,X2))
    | ~ big_g(X1,X2) ),
    inference(spm,[status(thm)],[c_0_8,c_0_6]),
    [final] ).

cnf(c_0_12,negated_conjecture,
    ( big_g(esk1_2(X1,X2),esk1_2(X1,X2))
    | big_g(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]),
    [final] ).

cnf(c_0_13,negated_conjecture,
    ( big_f(esk1_2(X1,X2),X2)
    | big_f(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]),
    [final] ).

cnf(c_0_14,negated_conjecture,
    ( big_g(X1,X2)
    | big_g(X2,esk1_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_2]),
    [final] ).

cnf(c_0_15,negated_conjecture,
    ( big_f(X1,X2)
    | ~ big_g(esk1_2(X1,X2),esk1_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_2]),
    [final] ).

cnf(c_0_16,negated_conjecture,
    ( big_g(X1,esk1_2(X2,X1))
    | ~ big_f(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]),
    [final] ).

cnf(c_0_17,negated_conjecture,
    ( ~ big_f(esk1_2(X1,X2),X2)
    | ~ big_f(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]),
    [final] ).

cnf(c_0_18,negated_conjecture,
    big_f(X1,esk1_2(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_2]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13  % Problem    : SYN335+1 : TPTP v8.2.0. Released v2.0.0.
% 0.10/0.13  % Command    : run_E %s %d SAT
% 0.13/0.34  % Computer : n021.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   : Sun Jun 23 19:19:54 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.21/0.50  Running first-order model finding
% 0.21/0.50  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/tmp/tmp.ef3lWvxmtD/E---3.1_27337.p
% 0.21/0.51  # Version: 3.2.0
% 0.21/0.51  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51  # Starting sh5l with 300s (1) cores
% 0.21/0.51  # new_bool_3 with pid 27415 completed with status 1
% 0.21/0.51  # Result found by new_bool_3
% 0.21/0.51  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51  # Search class: FGHNF-FFSF22-SFFFFFNN
% 0.21/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.51  # SAT001_MinMin_p005000_rr_RG with pid 27419 completed with status 1
% 0.21/0.51  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.51  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51  # Search class: FGHNF-FFSF22-SFFFFFNN
% 0.21/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.51  # Preprocessing time       : 0.001 s
% 0.21/0.51  # Presaturation interreduction done
% 0.21/0.51  
% 0.21/0.51  # No proof found!
% 0.21/0.51  # SZS status CounterSatisfiable
% 0.21/0.51  # SZS output start Saturation
% See solution above
% 0.21/0.51  # Parsed axioms                        : 1
% 0.21/0.51  # Removed by relevancy pruning/SinE    : 0
% 0.21/0.51  # Initial clauses                      : 12
% 0.21/0.51  # Removed in clause preprocessing      : 0
% 0.21/0.51  # Initial clauses in saturation        : 12
% 0.21/0.51  # Processed clauses                    : 29
% 0.21/0.51  # ...of these trivial                  : 0
% 0.21/0.51  # ...subsumed                          : 2
% 0.21/0.51  # ...remaining for further processing  : 27
% 0.21/0.51  # Other redundant clauses eliminated   : 0
% 0.21/0.51  # Clauses deleted for lack of memory   : 0
% 0.21/0.51  # Backward-subsumed                    : 1
% 0.21/0.51  # Backward-rewritten                   : 0
% 0.21/0.51  # Generated clauses                    : 11
% 0.21/0.51  # ...of the previous two non-redundant : 5
% 0.21/0.51  # ...aggressively subsumed             : 0
% 0.21/0.51  # Contextual simplify-reflections      : 1
% 0.21/0.51  # Paramodulations                      : 11
% 0.21/0.51  # Factorizations                       : 0
% 0.21/0.51  # NegExts                              : 0
% 0.21/0.51  # Equation resolutions                 : 0
% 0.21/0.51  # Disequality decompositions           : 0
% 0.21/0.51  # Total rewrite steps                  : 0
% 0.21/0.51  # ...of those cached                   : 0
% 0.21/0.51  # Propositional unsat checks           : 0
% 0.21/0.51  #    Propositional check models        : 0
% 0.21/0.51  #    Propositional check unsatisfiable : 0
% 0.21/0.51  #    Propositional clauses             : 0
% 0.21/0.51  #    Propositional clauses after purity: 0
% 0.21/0.51  #    Propositional unsat core size     : 0
% 0.21/0.51  #    Propositional preprocessing time  : 0.000
% 0.21/0.51  #    Propositional encoding time       : 0.000
% 0.21/0.51  #    Propositional solver time         : 0.000
% 0.21/0.51  #    Success case prop preproc time    : 0.000
% 0.21/0.51  #    Success case prop encoding time   : 0.000
% 0.21/0.51  #    Success case prop solver time     : 0.000
% 0.21/0.51  # Current number of processed clauses  : 14
% 0.21/0.51  #    Positive orientable unit clauses  : 1
% 0.21/0.51  #    Positive unorientable unit clauses: 0
% 0.21/0.51  #    Negative unit clauses             : 0
% 0.21/0.51  #    Non-unit-clauses                  : 13
% 0.21/0.51  # Current number of unprocessed clauses: 0
% 0.21/0.51  # ...number of literals in the above   : 0
% 0.21/0.51  # Current number of archived formulas  : 0
% 0.21/0.51  # Current number of archived clauses   : 13
% 0.21/0.51  # Clause-clause subsumption calls (NU) : 32
% 0.21/0.51  # Rec. Clause-clause subsumption calls : 30
% 0.21/0.51  # Non-unit clause-clause subsumptions  : 4
% 0.21/0.51  # Unit Clause-clause subsumption calls : 0
% 0.21/0.51  # Rewrite failures with RHS unbound    : 0
% 0.21/0.51  # BW rewrite match attempts            : 0
% 0.21/0.51  # BW rewrite match successes           : 0
% 0.21/0.51  # Condensation attempts                : 0
% 0.21/0.51  # Condensation successes               : 0
% 0.21/0.51  # Termbank termtop insertions          : 1150
% 0.21/0.51  # Search garbage collected termcells   : 245
% 0.21/0.51  
% 0.21/0.51  # -------------------------------------------------
% 0.21/0.51  # User time                : 0.004 s
% 0.21/0.51  # System time              : 0.001 s
% 0.21/0.51  # Total time               : 0.005 s
% 0.21/0.51  # Maximum resident set size: 1736 pages
% 0.21/0.51  
% 0.21/0.51  # -------------------------------------------------
% 0.21/0.51  # User time                : 0.005 s
% 0.21/0.51  # System time              : 0.003 s
% 0.21/0.51  # Total time               : 0.008 s
% 0.21/0.51  # Maximum resident set size: 1676 pages
% 0.21/0.51  % E---3.1 exiting
% 0.21/0.51  % E exiting
%------------------------------------------------------------------------------