TSTP Solution File: CSR113+18 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : CSR113+18 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n003.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 May 20 19:15:49 EDT 2024

% Result   : Theorem 1.03s 0.77s
% Output   : CNFRefutation 1.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   17 (   9 unt;   0 def)
%            Number of atoms       :  172 (   0 equ)
%            Maximal formula atoms :  123 (  10 avg)
%            Number of connectives :  183 (  28   ~;  21   |; 134   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :  123 (  11 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   21 (  20 usr;   1 prp; 0-3 aty)
%            Number of functors    :   44 (  44 usr;  44 con; 0-0 aty)
%            Number of variables   :   30 (   7 sgn   5   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(synth_qa07_003_mira_wp_222_a19713,conjecture,
    ? [X1,X2,X3,X4,X5] :
      ( attr(X3,X2)
      & loc(X4,X1)
      & scar(X4,X5)
      & sub(X2,name_1_1)
      & sub(X5,freiheitsstatue_1_1)
      & subs(X4,stehen_1_1)
      & val(X2,new_york_0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',synth_qa07_003_mira_wp_222_a19713) ).

fof(ave07_era5_synth_qa07_003_mira_wp_222_a19713,hypothesis,
    ( supl(c34,bekannt_1_1,c35)
    & prop(c4,c34)
    & sub(c4,freiheitsstatue_1_1)
    & attr(c41,c42)
    & sub(c41,stadt__1_1)
    & sub(c42,name_1_1)
    & val(c42,new_york_0)
    & mexp(c44,c50)
    & semrel(c44,c8)
    & subs(c44,sehen_1_1)
    & vor(c53,c41)
    & loc(c8,c53)
    & scar(c8,c4)
    & subs(c8,stehen_1_1)
    & assoc(freiheitsstatue_1_1,freiheit_1_1)
    & sub(freiheitsstatue_1_1,statue_1_1)
    & sort(c34,tq)
    & sort(bekannt_1_1,nq)
    & sort(c35,o)
    & card(c35,card_c)
    & etype(c35,int1)
    & etype(c35,int2)
    & fact(c35,real)
    & gener(c35,gener_c)
    & quant(c35,quant_c)
    & refer(c35,refer_c)
    & varia(c35,varia_c)
    & sort(c4,d)
    & card(c4,int1)
    & etype(c4,int0)
    & fact(c4,real)
    & gener(c4,sp)
    & quant(c4,one)
    & refer(c4,det)
    & varia(c4,con)
    & sort(freiheitsstatue_1_1,d)
    & card(freiheitsstatue_1_1,int1)
    & etype(freiheitsstatue_1_1,int0)
    & fact(freiheitsstatue_1_1,real)
    & gener(freiheitsstatue_1_1,ge)
    & quant(freiheitsstatue_1_1,one)
    & refer(freiheitsstatue_1_1,refer_c)
    & varia(freiheitsstatue_1_1,varia_c)
    & sort(c41,d)
    & sort(c41,io)
    & card(c41,int1)
    & etype(c41,int0)
    & fact(c41,real)
    & gener(c41,sp)
    & quant(c41,one)
    & refer(c41,det)
    & varia(c41,con)
    & sort(c42,na)
    & card(c42,int1)
    & etype(c42,int0)
    & fact(c42,real)
    & gener(c42,sp)
    & quant(c42,one)
    & refer(c42,indet)
    & varia(c42,varia_c)
    & sort(stadt__1_1,d)
    & sort(stadt__1_1,io)
    & card(stadt__1_1,int1)
    & etype(stadt__1_1,int0)
    & fact(stadt__1_1,real)
    & gener(stadt__1_1,ge)
    & quant(stadt__1_1,one)
    & refer(stadt__1_1,refer_c)
    & varia(stadt__1_1,varia_c)
    & sort(name_1_1,na)
    & card(name_1_1,int1)
    & etype(name_1_1,int0)
    & fact(name_1_1,real)
    & gener(name_1_1,ge)
    & quant(name_1_1,one)
    & refer(name_1_1,refer_c)
    & varia(name_1_1,varia_c)
    & sort(new_york_0,fe)
    & sort(c44,dn)
    & fact(c44,real)
    & gener(c44,sp)
    & sort(c50,d)
    & card(c50,int1)
    & etype(c50,int0)
    & fact(c50,real)
    & gener(c50,sp)
    & quant(c50,one)
    & refer(c50,det)
    & varia(c50,varia_c)
    & sort(c8,st)
    & fact(c8,real)
    & gener(c8,sp)
    & sort(sehen_1_1,dn)
    & fact(sehen_1_1,real)
    & gener(sehen_1_1,ge)
    & sort(c53,l)
    & card(c53,int1)
    & etype(c53,int0)
    & fact(c53,real)
    & gener(c53,sp)
    & quant(c53,one)
    & refer(c53,det)
    & varia(c53,con)
    & sort(stehen_1_1,st)
    & fact(stehen_1_1,real)
    & gener(stehen_1_1,ge)
    & sort(freiheit_1_1,as)
    & sort(freiheit_1_1,io)
    & card(freiheit_1_1,int1)
    & etype(freiheit_1_1,int0)
    & fact(freiheit_1_1,real)
    & gener(freiheit_1_1,ge)
    & quant(freiheit_1_1,one)
    & refer(freiheit_1_1,refer_c)
    & varia(freiheit_1_1,varia_c)
    & sort(statue_1_1,d)
    & card(statue_1_1,int1)
    & etype(statue_1_1,int0)
    & fact(statue_1_1,real)
    & gener(statue_1_1,ge)
    & quant(statue_1_1,one)
    & refer(statue_1_1,refer_c)
    & varia(statue_1_1,varia_c) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ave07_era5_synth_qa07_003_mira_wp_222_a19713) ).

fof(c_0_2,negated_conjecture,
    ~ ? [X1,X2,X3,X4,X5] :
        ( attr(X3,X2)
        & loc(X4,X1)
        & scar(X4,X5)
        & sub(X2,name_1_1)
        & sub(X5,freiheitsstatue_1_1)
        & subs(X4,stehen_1_1)
        & val(X2,new_york_0) ),
    inference(assume_negation,[status(cth)],[synth_qa07_003_mira_wp_222_a19713]) ).

fof(c_0_3,negated_conjecture,
    ! [X8,X9,X10,X11,X12] :
      ( ~ attr(X10,X9)
      | ~ loc(X11,X8)
      | ~ scar(X11,X12)
      | ~ sub(X9,name_1_1)
      | ~ sub(X12,freiheitsstatue_1_1)
      | ~ subs(X11,stehen_1_1)
      | ~ val(X9,new_york_0) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

cnf(c_0_4,negated_conjecture,
    ( ~ attr(X1,X2)
    | ~ loc(X3,X4)
    | ~ scar(X3,X5)
    | ~ sub(X2,name_1_1)
    | ~ sub(X5,freiheitsstatue_1_1)
    | ~ subs(X3,stehen_1_1)
    | ~ val(X2,new_york_0) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_5,hypothesis,
    val(c42,new_york_0),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mira_wp_222_a19713]) ).

cnf(c_0_6,hypothesis,
    sub(c42,name_1_1),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mira_wp_222_a19713]) ).

cnf(c_0_7,hypothesis,
    ( ~ attr(X1,c42)
    | ~ scar(X2,X3)
    | ~ loc(X2,X4)
    | ~ subs(X2,stehen_1_1)
    | ~ sub(X3,freiheitsstatue_1_1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6])]) ).

cnf(c_0_8,hypothesis,
    attr(c41,c42),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mira_wp_222_a19713]) ).

cnf(c_0_9,hypothesis,
    ( ~ scar(X1,X2)
    | ~ loc(X1,X3)
    | ~ subs(X1,stehen_1_1)
    | ~ sub(X2,freiheitsstatue_1_1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,hypothesis,
    subs(c8,stehen_1_1),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mira_wp_222_a19713]) ).

cnf(c_0_11,hypothesis,
    ( ~ scar(c8,X1)
    | ~ loc(c8,X2)
    | ~ sub(X1,freiheitsstatue_1_1) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_12,hypothesis,
    scar(c8,c4),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mira_wp_222_a19713]) ).

cnf(c_0_13,hypothesis,
    sub(c4,freiheitsstatue_1_1),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mira_wp_222_a19713]) ).

cnf(c_0_14,hypothesis,
    loc(c8,c53),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mira_wp_222_a19713]) ).

cnf(c_0_15,hypothesis,
    ~ loc(c8,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).

cnf(c_0_16,hypothesis,
    $false,
    inference(sr,[status(thm)],[c_0_14,c_0_15]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : CSR113+18 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n003.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun May 19 01:05:08 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.21/0.49  Running first-order theorem proving
% 0.21/0.49  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.03/0.77  # Version: 3.1.0
% 1.03/0.77  # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.03/0.77  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.77  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.03/0.77  # Starting new_bool_3 with 300s (1) cores
% 1.03/0.77  # Starting new_bool_1 with 300s (1) cores
% 1.03/0.77  # Starting sh5l with 300s (1) cores
% 1.03/0.77  # new_bool_3 with pid 25595 completed with status 0
% 1.03/0.77  # Result found by new_bool_3
% 1.03/0.77  # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.03/0.77  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.77  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.03/0.77  # Starting new_bool_3 with 300s (1) cores
% 1.03/0.77  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.03/0.77  # Search class: FHHNF-FSMM33-SFFFFFNN
% 1.03/0.77  # partial match(2): FGHNF-FSLM33-SFFFFFNN
% 1.03/0.77  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.03/0.77  # Starting G-E--_207_C41_F1_AE_CS_SP_PI_S4S with 181s (1) cores
% 1.03/0.77  # G-E--_207_C41_F1_AE_CS_SP_PI_S4S with pid 25605 completed with status 0
% 1.03/0.77  # Result found by G-E--_207_C41_F1_AE_CS_SP_PI_S4S
% 1.03/0.77  # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.03/0.77  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.77  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.03/0.77  # Starting new_bool_3 with 300s (1) cores
% 1.03/0.77  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.03/0.77  # Search class: FHHNF-FSMM33-SFFFFFNN
% 1.03/0.77  # partial match(2): FGHNF-FSLM33-SFFFFFNN
% 1.03/0.77  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.03/0.77  # Starting G-E--_207_C41_F1_AE_CS_SP_PI_S4S with 181s (1) cores
% 1.03/0.77  # Preprocessing time       : 0.014 s
% 1.03/0.77  
% 1.03/0.77  # Proof found!
% 1.03/0.77  # SZS status Theorem
% 1.03/0.77  # SZS output start CNFRefutation
% See solution above
% 1.03/0.77  # Parsed axioms                        : 10189
% 1.03/0.77  # Removed by relevancy pruning/SinE    : 10112
% 1.03/0.77  # Initial clauses                      : 231
% 1.03/0.77  # Removed in clause preprocessing      : 0
% 1.03/0.77  # Initial clauses in saturation        : 231
% 1.03/0.77  # Processed clauses                    : 241
% 1.03/0.77  # ...of these trivial                  : 2
% 1.03/0.77  # ...subsumed                          : 0
% 1.03/0.77  # ...remaining for further processing  : 239
% 1.03/0.77  # Other redundant clauses eliminated   : 0
% 1.03/0.77  # Clauses deleted for lack of memory   : 0
% 1.03/0.77  # Backward-subsumed                    : 3
% 1.03/0.77  # Backward-rewritten                   : 0
% 1.03/0.77  # Generated clauses                    : 141
% 1.03/0.77  # ...of the previous two non-redundant : 140
% 1.03/0.77  # ...aggressively subsumed             : 0
% 1.03/0.77  # Contextual simplify-reflections      : 0
% 1.03/0.77  # Paramodulations                      : 140
% 1.03/0.77  # Factorizations                       : 0
% 1.03/0.77  # NegExts                              : 0
% 1.03/0.77  # Equation resolutions                 : 0
% 1.03/0.77  # Disequality decompositions           : 0
% 1.03/0.77  # Total rewrite steps                  : 4
% 1.03/0.77  # ...of those cached                   : 0
% 1.03/0.77  # Propositional unsat checks           : 0
% 1.03/0.77  #    Propositional check models        : 0
% 1.03/0.77  #    Propositional check unsatisfiable : 0
% 1.03/0.77  #    Propositional clauses             : 0
% 1.03/0.77  #    Propositional clauses after purity: 0
% 1.03/0.77  #    Propositional unsat core size     : 0
% 1.03/0.77  #    Propositional preprocessing time  : 0.000
% 1.03/0.77  #    Propositional encoding time       : 0.000
% 1.03/0.77  #    Propositional solver time         : 0.000
% 1.03/0.77  #    Success case prop preproc time    : 0.000
% 1.03/0.77  #    Success case prop encoding time   : 0.000
% 1.03/0.77  #    Success case prop solver time     : 0.000
% 1.03/0.77  # Current number of processed clauses  : 235
% 1.03/0.77  #    Positive orientable unit clauses  : 158
% 1.03/0.77  #    Positive unorientable unit clauses: 0
% 1.03/0.77  #    Negative unit clauses             : 1
% 1.03/0.77  #    Non-unit-clauses                  : 76
% 1.03/0.77  # Current number of unprocessed clauses: 130
% 1.03/0.77  # ...number of literals in the above   : 162
% 1.03/0.77  # Current number of archived formulas  : 0
% 1.03/0.77  # Current number of archived clauses   : 4
% 1.03/0.77  # Clause-clause subsumption calls (NU) : 2963
% 1.03/0.77  # Rec. Clause-clause subsumption calls : 643
% 1.03/0.77  # Non-unit clause-clause subsumptions  : 2
% 1.03/0.77  # Unit Clause-clause subsumption calls : 154
% 1.03/0.77  # Rewrite failures with RHS unbound    : 0
% 1.03/0.77  # BW rewrite match attempts            : 0
% 1.03/0.77  # BW rewrite match successes           : 0
% 1.03/0.77  # Condensation attempts                : 0
% 1.03/0.77  # Condensation successes               : 0
% 1.03/0.77  # Termbank termtop insertions          : 52653
% 1.03/0.77  # Search garbage collected termcells   : 39245
% 1.03/0.77  
% 1.03/0.77  # -------------------------------------------------
% 1.03/0.77  # User time                : 0.062 s
% 1.03/0.77  # System time              : 0.063 s
% 1.03/0.77  # Total time               : 0.125 s
% 1.03/0.77  # Maximum resident set size: 42496 pages
% 1.03/0.77  
% 1.03/0.77  # -------------------------------------------------
% 1.03/0.77  # User time                : 0.147 s
% 1.03/0.77  # System time              : 0.082 s
% 1.03/0.77  # Total time               : 0.229 s
% 1.03/0.77  # Maximum resident set size: 10632 pages
% 1.03/0.77  % E---3.1 exiting
% 1.03/0.77  % E exiting
%------------------------------------------------------------------------------