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

View Problem - Process Solution

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

% Computer : n015.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:24 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
cnf(transitivity_for_equidistance,axiom,
    ( equidistant(X3,X4,X5,X6)
    | ~ equidistant(X1,X2,X3,X4)
    | ~ equidistant(X1,X2,X5,X6) ),
    file('/export/starexec/sandbox/tmp/tmp.yQotiphtR7/E---3.1_21809.p',transitivity_for_equidistance) ).

cnf(reflexivity_for_equidistance,axiom,
    equidistant(X1,X2,X2,X1),
    file('/export/starexec/sandbox/tmp/tmp.yQotiphtR7/E---3.1_21809.p',reflexivity_for_equidistance) ).

cnf(u_to_v_equals_w_to_x,hypothesis,
    equidistant(u,v,w,x),
    file('/export/starexec/sandbox/tmp/tmp.yQotiphtR7/E---3.1_21809.p',u_to_v_equals_w_to_x) ).

cnf(d2,axiom,
    ( equidistant(X3,X4,X1,X2)
    | ~ equidistant(X1,X2,X3,X4) ),
    file('/export/starexec/sandbox/tmp/tmp.yQotiphtR7/E---3.1_21809.p',d2) ).

cnf(prove_symmetry,negated_conjecture,
    ~ equidistant(v,u,w,x),
    file('/export/starexec/sandbox/tmp/tmp.yQotiphtR7/E---3.1_21809.p',prove_symmetry) ).

cnf(c_0_5,axiom,
    ( equidistant(X3,X4,X5,X6)
    | ~ equidistant(X1,X2,X3,X4)
    | ~ equidistant(X1,X2,X5,X6) ),
    transitivity_for_equidistance ).

cnf(c_0_6,axiom,
    equidistant(X1,X2,X2,X1),
    reflexivity_for_equidistance ).

cnf(c_0_7,plain,
    ( equidistant(X1,X2,X3,X4)
    | ~ equidistant(X4,X3,X1,X2) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,hypothesis,
    equidistant(u,v,w,x),
    u_to_v_equals_w_to_x ).

cnf(c_0_9,axiom,
    ( equidistant(X3,X4,X1,X2)
    | ~ equidistant(X1,X2,X3,X4) ),
    d2 ).

cnf(c_0_10,hypothesis,
    equidistant(w,x,v,u),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    ~ equidistant(v,u,w,x),
    prove_symmetry ).

cnf(c_0_12,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : GEO016-3 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n015.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 07:09:01 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 0.20/0.48  Running first-order model finding
% 0.20/0.48  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.yQotiphtR7/E---3.1_21809.p
% 0.20/0.50  # Version: 3.1pre001
% 0.20/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50  # Starting sh5l with 300s (1) cores
% 0.20/0.50  # new_bool_3 with pid 21891 completed with status 0
% 0.20/0.50  # Result found by new_bool_3
% 0.20/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50  # Search class: FGUSS-FFSF00-SFFFFFNN
% 0.20/0.50  # partial match(1): FGUSF-FFSF00-SFFFFFNN
% 0.20/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50  # SAT001_MinMin_p005000_rr_RG with pid 21895 completed with status 0
% 0.20/0.50  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50  # Search class: FGUSS-FFSF00-SFFFFFNN
% 0.20/0.50  # partial match(1): FGUSF-FFSF00-SFFFFFNN
% 0.20/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50  # Preprocessing time       : 0.001 s
% 0.20/0.50  # Presaturation interreduction done
% 0.20/0.50  
% 0.20/0.50  # Proof found!
% 0.20/0.50  # SZS status Unsatisfiable
% 0.20/0.50  # SZS output start CNFRefutation
% See solution above
% 0.20/0.50  # Parsed axioms                        : 22
% 0.20/0.50  # Removed by relevancy pruning/SinE    : 12
% 0.20/0.50  # Initial clauses                      : 10
% 0.20/0.50  # Removed in clause preprocessing      : 0
% 0.20/0.50  # Initial clauses in saturation        : 10
% 0.20/0.50  # Processed clauses                    : 24
% 0.20/0.50  # ...of these trivial                  : 0
% 0.20/0.50  # ...subsumed                          : 0
% 0.20/0.50  # ...remaining for further processing  : 24
% 0.20/0.50  # Other redundant clauses eliminated   : 0
% 0.20/0.50  # Clauses deleted for lack of memory   : 0
% 0.20/0.50  # Backward-subsumed                    : 0
% 0.20/0.50  # Backward-rewritten                   : 0
% 0.20/0.50  # Generated clauses                    : 24
% 0.20/0.50  # ...of the previous two non-redundant : 15
% 0.20/0.50  # ...aggressively subsumed             : 0
% 0.20/0.50  # Contextual simplify-reflections      : 0
% 0.20/0.50  # Paramodulations                      : 24
% 0.20/0.50  # Factorizations                       : 0
% 0.20/0.50  # NegExts                              : 0
% 0.20/0.50  # Equation resolutions                 : 0
% 0.20/0.50  # Total rewrite steps                  : 5
% 0.20/0.50  # Propositional unsat checks           : 0
% 0.20/0.50  #    Propositional check models        : 0
% 0.20/0.50  #    Propositional check unsatisfiable : 0
% 0.20/0.50  #    Propositional clauses             : 0
% 0.20/0.50  #    Propositional clauses after purity: 0
% 0.20/0.50  #    Propositional unsat core size     : 0
% 0.20/0.50  #    Propositional preprocessing time  : 0.000
% 0.20/0.50  #    Propositional encoding time       : 0.000
% 0.20/0.50  #    Propositional solver time         : 0.000
% 0.20/0.50  #    Success case prop preproc time    : 0.000
% 0.20/0.50  #    Success case prop encoding time   : 0.000
% 0.20/0.50  #    Success case prop solver time     : 0.000
% 0.20/0.50  # Current number of processed clauses  : 14
% 0.20/0.50  #    Positive orientable unit clauses  : 6
% 0.20/0.50  #    Positive unorientable unit clauses: 0
% 0.20/0.50  #    Negative unit clauses             : 1
% 0.20/0.50  #    Non-unit-clauses                  : 7
% 0.20/0.50  # Current number of unprocessed clauses: 11
% 0.20/0.50  # ...number of literals in the above   : 45
% 0.20/0.50  # Current number of archived formulas  : 0
% 0.20/0.50  # Current number of archived clauses   : 10
% 0.20/0.50  # Clause-clause subsumption calls (NU) : 121
% 0.20/0.50  # Rec. Clause-clause subsumption calls : 63
% 0.20/0.50  # Non-unit clause-clause subsumptions  : 0
% 0.20/0.50  # Unit Clause-clause subsumption calls : 0
% 0.20/0.50  # Rewrite failures with RHS unbound    : 0
% 0.20/0.50  # BW rewrite match attempts            : 16
% 0.20/0.50  # BW rewrite match successes           : 0
% 0.20/0.50  # Condensation attempts                : 0
% 0.20/0.50  # Condensation successes               : 0
% 0.20/0.50  # Termbank termtop insertions          : 683
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.003 s
% 0.20/0.50  # System time              : 0.002 s
% 0.20/0.50  # Total time               : 0.005 s
% 0.20/0.50  # Maximum resident set size: 1624 pages
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.005 s
% 0.20/0.50  # System time              : 0.004 s
% 0.20/0.50  # Total time               : 0.008 s
% 0.20/0.50  # Maximum resident set size: 1688 pages
% 0.20/0.50  % E---3.1 exiting
%------------------------------------------------------------------------------