TSTP Solution File: GEO048-3 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : GEO048-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n019.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 17:33:34 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
cnf(t1,axiom,
    ( between(X3,X2,X1)
    | ~ between(X1,X2,X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.gJ6nQh18U2/E---3.1_11065.p',t1) ).

cnf(v_between_u_and_w,hypothesis,
    between(u,v,w),
    file('/export/starexec/sandbox2/tmp/tmp.gJ6nQh18U2/E---3.1_11065.p',v_between_u_and_w) ).

cnf(prove_conclusion2,negated_conjecture,
    ~ between(v,inner_pasch(v1,inner_pasch(u,x,u1,v1,w),u,v,w),v1),
    file('/export/starexec/sandbox2/tmp/tmp.gJ6nQh18U2/E---3.1_11065.p',prove_conclusion2) ).

cnf(inner_pasch2,axiom,
    ( between(X5,inner_pasch(X1,X2,X3,X5,X4),X1)
    | ~ between(X1,X2,X3)
    | ~ between(X4,X5,X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.gJ6nQh18U2/E---3.1_11065.p',inner_pasch2) ).

cnf(v1_between_u1_and_w,hypothesis,
    between(u1,v1,w),
    file('/export/starexec/sandbox2/tmp/tmp.gJ6nQh18U2/E---3.1_11065.p',v1_between_u1_and_w) ).

cnf(x_between_u_and_u1,hypothesis,
    between(u,x,u1),
    file('/export/starexec/sandbox2/tmp/tmp.gJ6nQh18U2/E---3.1_11065.p',x_between_u_and_u1) ).

cnf(c_0_6,axiom,
    ( between(X3,X2,X1)
    | ~ between(X1,X2,X3) ),
    t1 ).

cnf(c_0_7,hypothesis,
    between(u,v,w),
    v_between_u_and_w ).

cnf(c_0_8,negated_conjecture,
    ~ between(v,inner_pasch(v1,inner_pasch(u,x,u1,v1,w),u,v,w),v1),
    prove_conclusion2 ).

cnf(c_0_9,axiom,
    ( between(X5,inner_pasch(X1,X2,X3,X5,X4),X1)
    | ~ between(X1,X2,X3)
    | ~ between(X4,X5,X3) ),
    inner_pasch2 ).

cnf(c_0_10,hypothesis,
    between(w,v,u),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_11,hypothesis,
    between(u1,v1,w),
    v1_between_u1_and_w ).

cnf(c_0_12,negated_conjecture,
    ~ between(v1,inner_pasch(u,x,u1,v1,w),u),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).

cnf(c_0_13,hypothesis,
    between(w,v1,u1),
    inference(spm,[status(thm)],[c_0_6,c_0_11]) ).

cnf(c_0_14,hypothesis,
    between(u,x,u1),
    x_between_u_and_u1 ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_9]),c_0_13]),c_0_14])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : GEO048-3 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n019.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 2400
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Oct  3 06:31:51 EDT 2023
% 0.13/0.35  % 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.gJ6nQh18U2/E---3.1_11065.p
% 0.19/0.50  # Version: 3.1pre001
% 0.19/0.50  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50  # Starting sh5l with 300s (1) cores
% 0.19/0.50  # new_bool_3 with pid 11144 completed with status 0
% 0.19/0.50  # Result found by new_bool_3
% 0.19/0.50  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50  # Search class: FGUSS-FFMS33-SFFFFFNN
% 0.19/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50  # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 150s (1) cores
% 0.19/0.50  # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 11147 completed with status 0
% 0.19/0.50  # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI
% 0.19/0.50  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50  # Search class: FGUSS-FFMS33-SFFFFFNN
% 0.19/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50  # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 150s (1) cores
% 0.19/0.50  # Preprocessing time       : 0.001 s
% 0.19/0.50  # Presaturation interreduction done
% 0.19/0.50  
% 0.19/0.50  # Proof found!
% 0.19/0.50  # SZS status Unsatisfiable
% 0.19/0.50  # SZS output start CNFRefutation
% See solution above
% 0.19/0.50  # Parsed axioms                        : 68
% 0.19/0.50  # Removed by relevancy pruning/SinE    : 46
% 0.19/0.50  # Initial clauses                      : 22
% 0.19/0.50  # Removed in clause preprocessing      : 1
% 0.19/0.50  # Initial clauses in saturation        : 21
% 0.19/0.50  # Processed clauses                    : 46
% 0.19/0.50  # ...of these trivial                  : 0
% 0.19/0.50  # ...subsumed                          : 2
% 0.19/0.50  # ...remaining for further processing  : 44
% 0.19/0.50  # Other redundant clauses eliminated   : 1
% 0.19/0.50  # Clauses deleted for lack of memory   : 0
% 0.19/0.50  # Backward-subsumed                    : 0
% 0.19/0.50  # Backward-rewritten                   : 0
% 0.19/0.50  # Generated clauses                    : 85
% 0.19/0.50  # ...of the previous two non-redundant : 71
% 0.19/0.50  # ...aggressively subsumed             : 0
% 0.19/0.50  # Contextual simplify-reflections      : 0
% 0.19/0.50  # Paramodulations                      : 84
% 0.19/0.50  # Factorizations                       : 0
% 0.19/0.50  # NegExts                              : 0
% 0.19/0.50  # Equation resolutions                 : 1
% 0.19/0.50  # Total rewrite steps                  : 13
% 0.19/0.50  # Propositional unsat checks           : 0
% 0.19/0.50  #    Propositional check models        : 0
% 0.19/0.50  #    Propositional check unsatisfiable : 0
% 0.19/0.50  #    Propositional clauses             : 0
% 0.19/0.50  #    Propositional clauses after purity: 0
% 0.19/0.50  #    Propositional unsat core size     : 0
% 0.19/0.50  #    Propositional preprocessing time  : 0.000
% 0.19/0.50  #    Propositional encoding time       : 0.000
% 0.19/0.50  #    Propositional solver time         : 0.000
% 0.19/0.50  #    Success case prop preproc time    : 0.000
% 0.19/0.50  #    Success case prop encoding time   : 0.000
% 0.19/0.50  #    Success case prop solver time     : 0.000
% 0.19/0.50  # Current number of processed clauses  : 24
% 0.19/0.50  #    Positive orientable unit clauses  : 8
% 0.19/0.50  #    Positive unorientable unit clauses: 0
% 0.19/0.50  #    Negative unit clauses             : 3
% 0.19/0.50  #    Non-unit-clauses                  : 13
% 0.19/0.50  # Current number of unprocessed clauses: 65
% 0.19/0.50  # ...number of literals in the above   : 180
% 0.19/0.50  # Current number of archived formulas  : 0
% 0.19/0.50  # Current number of archived clauses   : 19
% 0.19/0.50  # Clause-clause subsumption calls (NU) : 272
% 0.19/0.50  # Rec. Clause-clause subsumption calls : 242
% 0.19/0.50  # Non-unit clause-clause subsumptions  : 2
% 0.19/0.50  # Unit Clause-clause subsumption calls : 2
% 0.19/0.50  # Rewrite failures with RHS unbound    : 0
% 0.19/0.50  # BW rewrite match attempts            : 14
% 0.19/0.50  # BW rewrite match successes           : 0
% 0.19/0.50  # Condensation attempts                : 0
% 0.19/0.50  # Condensation successes               : 0
% 0.19/0.50  # Termbank termtop insertions          : 1560
% 0.19/0.50  
% 0.19/0.50  # -------------------------------------------------
% 0.19/0.50  # User time                : 0.004 s
% 0.19/0.50  # System time              : 0.001 s
% 0.19/0.50  # Total time               : 0.005 s
% 0.19/0.50  # Maximum resident set size: 1788 pages
% 0.19/0.50  
% 0.19/0.50  # -------------------------------------------------
% 0.19/0.50  # User time                : 0.007 s
% 0.19/0.50  # System time              : 0.002 s
% 0.19/0.50  # Total time               : 0.009 s
% 0.19/0.50  # Maximum resident set size: 1724 pages
% 0.19/0.50  % E---3.1 exiting
%------------------------------------------------------------------------------