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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : CSR114+18 : TPTP v8.1.2. Released v4.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 : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 07:33:52 EDT 2024

% Result   : Theorem 3.61s 2.89s
% Output   : CNFRefutation 3.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   23 (  10 unt;   0 def)
%            Number of atoms       :  280 (   0 equ)
%            Maximal formula atoms :  209 (  12 avg)
%            Number of connectives :  294 (  37   ~;  30   |; 226   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :  209 (  13 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   26 (  25 usr;   1 prp; 0-2 aty)
%            Number of functors    :   58 (  58 usr;  57 con; 0-2 aty)
%            Number of variables   :   41 (   5 sgn   9   !;  11   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(synth_qa07_004_qapn_64_a281,conjecture,
    ? [X1,X2,X3,X4,X5] :
      ( in(X3,X1)
      & attr(X1,X2)
      & loc(X5,X3)
      & scar(X5,X4)
      & sub(X2,name_1_1)
      & sub(X1,stadt__1_1)
      & subs(X5,stehen_1_1)
      & val(X2,rom_0) ),
    file('/export/starexec/sandbox2/tmp/tmp.My9LDKV3Qc/E---3.1_418.p',synth_qa07_004_qapn_64_a281) ).

fof(ave07_era5_synth_qa07_004_qapn_64_a281,hypothesis,
    ( prop(c10,arglistig_1_1)
    & subs(c10,n374berraschung_1_1)
    & sub(c15,dienstag__1_1)
    & poss(c184,c204)
    & sub(c190,kolosseum_1_1)
    & attr(c196,c197)
    & sub(c196,stadt__1_1)
    & sub(c197,name_1_1)
    & val(c197,rom_0)
    & sub(c204,auto__1_1)
    & agt(c205,c184)
    & dircl(c205,c243)
    & loc(c205,c244)
    & loc(c205,c245)
    & modl(c205,wollen_0)
    & subs(c205,steigen_1_2)
    & in(c243,c204)
    & in(c244,c196)
    & vor(c245,c190)
    & prop(c25,n344gyptisch_1_1)
    & sub(c25,ehepaar_3_1)
    & exp(c31,c25)
    & obj(c31,c10)
    & subs(c31,erleben_1_1)
    & temp(c31,c15)
    & temp(c31,c205)
    & assoc(ehepaar_3_1,ehe_2_1)
    & sub(ehepaar_3_1,paar_3_1)
    & sort(c10,ad)
    & card(c10,int1)
    & etype(c10,int0)
    & fact(c10,real)
    & gener(c10,sp)
    & quant(c10,one)
    & refer(c10,indet)
    & varia(c10,varia_c)
    & sort(arglistig_1_1,nq)
    & sort(n374berraschung_1_1,ad)
    & card(n374berraschung_1_1,int1)
    & etype(n374berraschung_1_1,int0)
    & fact(n374berraschung_1_1,real)
    & gener(n374berraschung_1_1,ge)
    & quant(n374berraschung_1_1,one)
    & refer(n374berraschung_1_1,refer_c)
    & varia(n374berraschung_1_1,varia_c)
    & sort(c15,ta)
    & card(c15,int1)
    & etype(c15,int0)
    & fact(c15,real)
    & gener(c15,sp)
    & quant(c15,one)
    & refer(c15,det)
    & varia(c15,con)
    & sort(dienstag__1_1,ta)
    & card(dienstag__1_1,int1)
    & etype(dienstag__1_1,int0)
    & fact(dienstag__1_1,real)
    & gener(dienstag__1_1,ge)
    & quant(dienstag__1_1,one)
    & refer(dienstag__1_1,refer_c)
    & varia(dienstag__1_1,varia_c)
    & sort(c184,o)
    & card(c184,int1)
    & etype(c184,int0)
    & fact(c184,real)
    & gener(c184,sp)
    & quant(c184,one)
    & refer(c184,det)
    & varia(c184,varia_c)
    & sort(c204,d)
    & card(c204,int1)
    & etype(c204,int0)
    & fact(c204,real)
    & gener(c204,sp)
    & quant(c204,one)
    & refer(c204,det)
    & varia(c204,varia_c)
    & sort(c190,d)
    & card(c190,int1)
    & etype(c190,int0)
    & fact(c190,real)
    & gener(c190,sp)
    & quant(c190,one)
    & refer(c190,det)
    & varia(c190,con)
    & sort(kolosseum_1_1,d)
    & card(kolosseum_1_1,int1)
    & etype(kolosseum_1_1,int0)
    & fact(kolosseum_1_1,real)
    & gener(kolosseum_1_1,sp)
    & quant(kolosseum_1_1,one)
    & refer(kolosseum_1_1,det)
    & varia(kolosseum_1_1,con)
    & sort(c196,d)
    & sort(c196,io)
    & card(c196,int1)
    & etype(c196,int0)
    & fact(c196,real)
    & gener(c196,sp)
    & quant(c196,one)
    & refer(c196,det)
    & varia(c196,con)
    & sort(c197,na)
    & card(c197,int1)
    & etype(c197,int0)
    & fact(c197,real)
    & gener(c197,sp)
    & quant(c197,one)
    & refer(c197,indet)
    & varia(c197,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(rom_0,fe)
    & sort(auto__1_1,d)
    & card(auto__1_1,int1)
    & etype(auto__1_1,int0)
    & fact(auto__1_1,real)
    & gener(auto__1_1,ge)
    & quant(auto__1_1,one)
    & refer(auto__1_1,refer_c)
    & varia(auto__1_1,varia_c)
    & sort(c205,da)
    & fact(c205,real)
    & gener(c205,sp)
    & sort(c243,l)
    & card(c243,int1)
    & etype(c243,int0)
    & fact(c243,real)
    & gener(c243,sp)
    & quant(c243,one)
    & refer(c243,det)
    & varia(c243,varia_c)
    & sort(c244,l)
    & card(c244,int1)
    & etype(c244,int0)
    & fact(c244,real)
    & gener(c244,sp)
    & quant(c244,one)
    & refer(c244,det)
    & varia(c244,con)
    & sort(c245,l)
    & card(c245,int1)
    & etype(c245,int0)
    & fact(c245,real)
    & gener(c245,sp)
    & quant(c245,one)
    & refer(c245,det)
    & varia(c245,con)
    & sort(wollen_0,md)
    & fact(wollen_0,real)
    & gener(wollen_0,gener_c)
    & sort(steigen_1_2,da)
    & fact(steigen_1_2,real)
    & gener(steigen_1_2,ge)
    & sort(c25,d)
    & card(c25,int1)
    & etype(c25,int1)
    & fact(c25,real)
    & gener(c25,sp)
    & quant(c25,one)
    & refer(c25,indet)
    & varia(c25,varia_c)
    & sort(n344gyptisch_1_1,nq)
    & sort(ehepaar_3_1,d)
    & card(ehepaar_3_1,card_c)
    & etype(ehepaar_3_1,int1)
    & fact(ehepaar_3_1,real)
    & gener(ehepaar_3_1,ge)
    & quant(ehepaar_3_1,quant_c)
    & refer(ehepaar_3_1,refer_c)
    & varia(ehepaar_3_1,varia_c)
    & sort(c31,dn)
    & fact(c31,real)
    & gener(c31,sp)
    & sort(erleben_1_1,dn)
    & fact(erleben_1_1,real)
    & gener(erleben_1_1,ge)
    & sort(ehe_2_1,as)
    & sort(ehe_2_1,re)
    & card(ehe_2_1,int1)
    & etype(ehe_2_1,int0)
    & fact(ehe_2_1,real)
    & gener(ehe_2_1,ge)
    & quant(ehe_2_1,one)
    & refer(ehe_2_1,refer_c)
    & varia(ehe_2_1,varia_c)
    & sort(paar_3_1,d)
    & card(paar_3_1,card_c)
    & etype(paar_3_1,int1)
    & fact(paar_3_1,real)
    & gener(paar_3_1,ge)
    & quant(paar_3_1,quant_c)
    & refer(paar_3_1,refer_c)
    & varia(paar_3_1,varia_c) ),
    file('/export/starexec/sandbox2/tmp/tmp.My9LDKV3Qc/E---3.1_418.p',ave07_era5_synth_qa07_004_qapn_64_a281) ).

fof(loc__stehen_1_1_loc,axiom,
    ! [X1,X2] :
      ( loc(X1,X2)
     => ? [X3] :
          ( loc(X3,X2)
          & scar(X3,X1)
          & subs(X3,stehen_1_1) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.My9LDKV3Qc/E---3.1_418.p',loc__stehen_1_1_loc) ).

fof(c_0_3,negated_conjecture,
    ~ ? [X1,X2,X3,X4,X5] :
        ( in(X3,X1)
        & attr(X1,X2)
        & loc(X5,X3)
        & scar(X5,X4)
        & sub(X2,name_1_1)
        & sub(X1,stadt__1_1)
        & subs(X5,stehen_1_1)
        & val(X2,rom_0) ),
    inference(assume_negation,[status(cth)],[synth_qa07_004_qapn_64_a281]) ).

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

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

cnf(c_0_6,hypothesis,
    val(c197,rom_0),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_64_a281]) ).

cnf(c_0_7,hypothesis,
    sub(c197,name_1_1),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_64_a281]) ).

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

cnf(c_0_9,hypothesis,
    attr(c196,c197),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_64_a281]) ).

cnf(c_0_10,hypothesis,
    sub(c196,stadt__1_1),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_64_a281]) ).

fof(c_0_11,plain,
    ! [X24,X25] :
      ( ( loc(esk3_2(X24,X25),X25)
        | ~ loc(X24,X25) )
      & ( scar(esk3_2(X24,X25),X24)
        | ~ loc(X24,X25) )
      & ( subs(esk3_2(X24,X25),stehen_1_1)
        | ~ loc(X24,X25) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[loc__stehen_1_1_loc])])])])]) ).

cnf(c_0_12,hypothesis,
    ( ~ in(X1,c196)
    | ~ scar(X2,X3)
    | ~ loc(X2,X1)
    | ~ subs(X2,stehen_1_1) ),
    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,
    in(c244,c196),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_64_a281]) ).

cnf(c_0_14,plain,
    ( loc(esk3_2(X1,X2),X2)
    | ~ loc(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_15,hypothesis,
    loc(c205,c244),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_64_a281]) ).

cnf(c_0_16,plain,
    ( subs(esk3_2(X1,X2),stehen_1_1)
    | ~ loc(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,hypothesis,
    ( ~ scar(X1,X2)
    | ~ loc(X1,c244)
    | ~ subs(X1,stehen_1_1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,hypothesis,
    loc(esk3_2(c205,c244),c244),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,hypothesis,
    subs(esk3_2(c205,c244),stehen_1_1),
    inference(spm,[status(thm)],[c_0_16,c_0_15]) ).

cnf(c_0_20,plain,
    ( scar(esk3_2(X1,X2),X1)
    | ~ loc(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_21,hypothesis,
    ~ scar(esk3_2(c205,c244),X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).

cnf(c_0_22,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_15]),c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 1.13/1.15  % Problem    : CSR114+18 : TPTP v8.1.2. Released v4.0.0.
% 1.13/1.16  % Command    : run_E %s %d THM
% 1.16/1.37  % Computer : n015.cluster.edu
% 1.16/1.37  % Model    : x86_64 x86_64
% 1.16/1.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.16/1.37  % Memory   : 8042.1875MB
% 1.16/1.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 1.16/1.37  % CPULimit   : 300
% 1.16/1.37  % WCLimit    : 300
% 1.16/1.37  % DateTime   : Fri May  3 14:42:09 EDT 2024
% 1.16/1.37  % CPUTime    : 
% 2.41/2.61  Running first-order theorem proving
% 2.41/2.61  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.My9LDKV3Qc/E---3.1_418.p
% 3.61/2.89  # Version: 3.1.0
% 3.61/2.89  # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.61/2.89  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.61/2.89  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.61/2.89  # Starting new_bool_3 with 300s (1) cores
% 3.61/2.89  # Starting new_bool_1 with 300s (1) cores
% 3.61/2.89  # Starting sh5l with 300s (1) cores
% 3.61/2.89  # new_bool_1 with pid 552 completed with status 0
% 3.61/2.89  # Result found by new_bool_1
% 3.61/2.89  # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.61/2.89  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.61/2.89  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.61/2.89  # Starting new_bool_3 with 300s (1) cores
% 3.61/2.89  # Starting new_bool_1 with 300s (1) cores
% 3.61/2.89  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.61/2.89  # Search class: FHHNF-FSMM32-SFFFFFNN
% 3.61/2.89  # partial match(2): FGHNF-FFMM32-SFFFFFNN
% 3.61/2.89  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.61/2.89  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 181s (1) cores
% 3.61/2.89  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 581 completed with status 0
% 3.61/2.89  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 3.61/2.89  # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.61/2.89  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.61/2.89  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.61/2.89  # Starting new_bool_3 with 300s (1) cores
% 3.61/2.89  # Starting new_bool_1 with 300s (1) cores
% 3.61/2.89  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.61/2.89  # Search class: FHHNF-FSMM32-SFFFFFNN
% 3.61/2.89  # partial match(2): FGHNF-FFMM32-SFFFFFNN
% 3.61/2.89  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.61/2.89  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 181s (1) cores
% 3.61/2.89  # Preprocessing time       : 0.011 s
% 3.61/2.89  # Presaturation interreduction done
% 3.61/2.89  
% 3.61/2.89  # Proof found!
% 3.61/2.89  # SZS status Theorem
% 3.61/2.89  # SZS output start CNFRefutation
% See solution above
% 3.61/2.89  # Parsed axioms                        : 10189
% 3.61/2.89  # Removed by relevancy pruning/SinE    : 10107
% 3.61/2.89  # Initial clauses                      : 307
% 3.61/2.89  # Removed in clause preprocessing      : 0
% 3.61/2.89  # Initial clauses in saturation        : 307
% 3.61/2.89  # Processed clauses                    : 875
% 3.61/2.89  # ...of these trivial                  : 4
% 3.61/2.89  # ...subsumed                          : 0
% 3.61/2.89  # ...remaining for further processing  : 870
% 3.61/2.89  # Other redundant clauses eliminated   : 0
% 3.61/2.89  # Clauses deleted for lack of memory   : 0
% 3.61/2.89  # Backward-subsumed                    : 0
% 3.61/2.89  # Backward-rewritten                   : 0
% 3.61/2.89  # Generated clauses                    : 326
% 3.61/2.89  # ...of the previous two non-redundant : 326
% 3.61/2.89  # ...aggressively subsumed             : 0
% 3.61/2.89  # Contextual simplify-reflections      : 0
% 3.61/2.89  # Paramodulations                      : 326
% 3.61/2.89  # Factorizations                       : 0
% 3.61/2.89  # NegExts                              : 0
% 3.61/2.89  # Equation resolutions                 : 0
% 3.61/2.89  # Disequality decompositions           : 0
% 3.61/2.89  # Total rewrite steps                  : 7
% 3.61/2.89  # ...of those cached                   : 0
% 3.61/2.89  # Propositional unsat checks           : 0
% 3.61/2.89  #    Propositional check models        : 0
% 3.61/2.89  #    Propositional check unsatisfiable : 0
% 3.61/2.89  #    Propositional clauses             : 0
% 3.61/2.89  #    Propositional clauses after purity: 0
% 3.61/2.89  #    Propositional unsat core size     : 0
% 3.61/2.89  #    Propositional preprocessing time  : 0.000
% 3.61/2.89  #    Propositional encoding time       : 0.000
% 3.61/2.89  #    Propositional solver time         : 0.000
% 3.61/2.89  #    Success case prop preproc time    : 0.000
% 3.61/2.89  #    Success case prop encoding time   : 0.000
% 3.61/2.89  #    Success case prop solver time     : 0.000
% 3.61/2.89  # Current number of processed clauses  : 563
% 3.61/2.89  #    Positive orientable unit clauses  : 475
% 3.61/2.89  #    Positive unorientable unit clauses: 0
% 3.61/2.89  #    Negative unit clauses             : 1
% 3.61/2.89  #    Non-unit-clauses                  : 87
% 3.61/2.89  # Current number of unprocessed clauses: 65
% 3.61/2.89  # ...number of literals in the above   : 173
% 3.61/2.89  # Current number of archived formulas  : 0
% 3.61/2.89  # Current number of archived clauses   : 307
% 3.61/2.89  # Clause-clause subsumption calls (NU) : 2613
% 3.61/2.89  # Rec. Clause-clause subsumption calls : 909
% 3.61/2.89  # Non-unit clause-clause subsumptions  : 0
% 3.61/2.89  # Unit Clause-clause subsumption calls : 761
% 3.61/2.89  # Rewrite failures with RHS unbound    : 0
% 3.61/2.89  # BW rewrite match attempts            : 0
% 3.61/2.89  # BW rewrite match successes           : 0
% 3.61/2.89  # Condensation attempts                : 0
% 3.61/2.89  # Condensation successes               : 0
% 3.61/2.89  # Termbank termtop insertions          : 56056
% 3.61/2.89  # Search garbage collected termcells   : 39188
% 3.61/2.89  
% 3.61/2.89  # -------------------------------------------------
% 3.61/2.89  # User time                : 0.083 s
% 3.61/2.89  # System time              : 0.082 s
% 3.61/2.89  # Total time               : 0.165 s
% 3.61/2.89  # Maximum resident set size: 42744 pages
% 3.61/2.89  
% 3.61/2.89  # -------------------------------------------------
% 3.61/2.89  # User time                : 0.148 s
% 3.61/2.89  # System time              : 0.096 s
% 3.61/2.89  # Total time               : 0.244 s
% 3.61/2.89  # Maximum resident set size: 10820 pages
% 3.61/2.89  % E---3.1 exiting
% 3.61/2.89  % E exiting
%------------------------------------------------------------------------------