↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR115+50 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n001.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:17:13 PM UTC 2026

% Result   : Theorem 1.65s 1.09s
% Output   : CNFRefutation 1.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   23 (  10 unt;   0 def)
%            Number of atoms       :  243 (   0 equ)
%            Maximal formula atoms :  180 (  10 avg)
%            Number of connectives :  256 (  36   ~;  27   |; 192   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :  180 (  12 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   18 (  17 usr;   1 prp; 0-5 aty)
%            Number of functors    :   47 (  47 usr;  46 con; 0-3 aty)
%            Number of variables   :   57 (  27 sgn  12   !;  13   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(synth_qa07_007_mira_news_1295_a19984,conjecture,
    ? [X1,X2,X3,X4,X5,X6] :
      ( val(X2,bmw_0)
      & subs(X4,n374bernehmen_1_1)
      & sub(X2,name_1_1)
      & sub(X1,firma_1_1)
      & attr(X5,X6)
      & attr(X3,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',synth_qa07_007_mira_news_1295_a19984) ).

fof(ave07_era5_synth_qa07_007_mira_news_1295_a19984,hypothesis,
    ( sort(m__374nchen_0,fe)
    & varia(stadt__1_1,varia_c)
    & refer(stadt__1_1,refer_c)
    & quant(stadt__1_1,one)
    & gener(stadt__1_1,ge)
    & fact(stadt__1_1,real)
    & etype(stadt__1_1,int0)
    & card(stadt__1_1,int1)
    & sort(stadt__1_1,io)
    & sort(stadt__1_1,d)
    & varia(c87,varia_c)
    & refer(c87,indet)
    & quant(c87,one)
    & gener(c87,sp)
    & fact(c87,real)
    & etype(c87,int0)
    & card(c87,int1)
    & sort(c87,na)
    & sort(bmw_0,fe)
    & varia(firma_1_1,varia_c)
    & refer(firma_1_1,refer_c)
    & quant(firma_1_1,one)
    & gener(firma_1_1,ge)
    & fact(firma_1_1,real)
    & etype(firma_1_1,int0)
    & card(firma_1_1,int1)
    & sort(firma_1_1,io)
    & sort(firma_1_1,d)
    & varia(c74,varia_c)
    & refer(c74,indet)
    & quant(c74,one)
    & gener(c74,sp)
    & fact(c74,real)
    & etype(c74,int0)
    & card(c74,int1)
    & sort(c74,na)
    & sort(rover_0,fe)
    & sort(britisch__1_1,nq)
    & varia(c56,varia_c)
    & refer(c56,indet)
    & quant(c56,one)
    & gener(c56,sp)
    & fact(c56,real)
    & etype(c56,int0)
    & card(c56,int1)
    & sort(c56,na)
    & varia(annahme_1_1,varia_c)
    & refer(annahme_1_1,refer_c)
    & quant(annahme_1_1,one)
    & gener(annahme_1_1,ge)
    & fact(annahme_1_1,real)
    & etype(annahme_1_1,int0)
    & card(annahme_1_1,int1)
    & sort(annahme_1_1,ad)
    & varia(c55,con)
    & refer(c55,det)
    & quant(c55,one)
    & gener(c55,sp)
    & fact(c55,real)
    & etype(c55,int0)
    & card(c55,int1)
    & sort(c55,io)
    & sort(c55,d)
    & sort(eu_0,fe)
    & varia(name_1_1,varia_c)
    & refer(name_1_1,refer_c)
    & quant(name_1_1,one)
    & gener(name_1_1,ge)
    & fact(name_1_1,real)
    & etype(name_1_1,int0)
    & card(name_1_1,int1)
    & sort(name_1_1,na)
    & varia(kommission_1_1,varia_c)
    & refer(kommission_1_1,refer_c)
    & quant(kommission_1_1,quant_c)
    & gener(kommission_1_1,ge)
    & fact(kommission_1_1,real)
    & etype(kommission_1_1,int1)
    & card(kommission_1_1,card_c)
    & sort(kommission_1_1,io)
    & sort(kommission_1_1,d)
    & varia(c19,varia_c)
    & refer(c19,det)
    & quant(c19,one)
    & gener(c19,sp)
    & fact(c19,real)
    & etype(c19,int0)
    & card(c19,int1)
    & sort(c19,na)
    & varia(c86,con)
    & refer(c86,det)
    & quant(c86,one)
    & gener(c86,sp)
    & fact(c86,real)
    & etype(c86,int0)
    & card(c86,int1)
    & sort(c86,io)
    & sort(c86,d)
    & varia(c73,con)
    & refer(c73,det)
    & quant(c73,one)
    & gener(c73,sp)
    & fact(c73,real)
    & etype(c73,int0)
    & card(c73,int1)
    & sort(c73,io)
    & sort(c73,d)
    & varia(c25,con)
    & refer(c25,det)
    & quant(c25,one)
    & gener(c25,sp)
    & fact(c25,real)
    & etype(c25,int0)
    & card(c25,int1)
    & sort(c25,ad)
    & varia(c18,varia_c)
    & refer(c18,det)
    & quant(c18,one)
    & gener(c18,sp)
    & fact(c18,real)
    & etype(c18,int1)
    & card(c18,int1)
    & sort(c18,io)
    & sort(c18,d)
    & varia(c171,varia_c)
    & refer(c171,refer_c)
    & quant(c171,quant_c)
    & gener(c171,gener_c)
    & fact(c171,real)
    & etype(c171,etype_c)
    & card(c171,card_c)
    & sort(c171,ent)
    & varia(fabrikant_1_1,varia_c)
    & refer(fabrikant_1_1,refer_c)
    & quant(fabrikant_1_1,one)
    & gener(fabrikant_1_1,ge)
    & fact(fabrikant_1_1,real)
    & etype(fabrikant_1_1,int0)
    & card(fabrikant_1_1,int1)
    & sort(fabrikant_1_1,io)
    & sort(fabrikant_1_1,d)
    & varia(auto__1_1,varia_c)
    & refer(auto__1_1,refer_c)
    & quant(auto__1_1,one)
    & gener(auto__1_1,ge)
    & fact(auto__1_1,real)
    & etype(auto__1_1,int0)
    & card(auto__1_1,int1)
    & sort(auto__1_1,d)
    & varia(autobauer_1_1,varia_c)
    & refer(autobauer_1_1,refer_c)
    & quant(autobauer_1_1,one)
    & gener(autobauer_1_1,ge)
    & fact(autobauer_1_1,real)
    & etype(autobauer_1_1,int0)
    & card(autobauer_1_1,int1)
    & sort(autobauer_1_1,io)
    & sort(autobauer_1_1,d)
    & val(c87,m__374nchen_0)
    & sub(c87,name_1_1)
    & sub(c86,stadt__1_1)
    & attr(c86,c87)
    & val(c74,bmw_0)
    & sub(c74,name_1_1)
    & sub(c73,firma_1_1)
    & attr(c73,c74)
    & val(c56,rover_0)
    & sub(c56,name_1_1)
    & sub(c55,autobauer_1_1)
    & prop(c55,britisch__1_1)
    & attr(c55,c56)
    & subs(c25,annahme_1_1)
    & obj(c25,c55)
    & val(c19,eu_0)
    & sub(c19,name_1_1)
    & sub(c18,kommission_1_1)
    & attr(c18,c19)
    & tupl_p5(c171,c18,c25,c73,c86)
    & sub(autobauer_1_1,fabrikant_1_1)
    & assoc(autobauer_1_1,auto__1_1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ave07_era5_synth_qa07_007_mira_news_1295_a19984) ).

fof(chea_subs_abs__event,axiom,
    ! [X1,X2,X3] :
      ( ( subs(X1,X2)
        & chea(X3,X2) )
     => ? [X4] :
          ( subs(X4,X3)
          & chea(X4,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR004+0.ax',chea_subs_abs__event) ).

fof(fact_8354,axiom,
    chea(n374bernehmen_1_1,annahme_1_1),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR004+0.ax',fact_8354) ).

fof(c_0_4,negated_conjecture,
    ~ ? [X1,X2,X3,X4,X5,X6] :
        ( val(X2,bmw_0)
        & subs(X4,n374bernehmen_1_1)
        & sub(X2,name_1_1)
        & sub(X1,firma_1_1)
        & attr(X5,X6)
        & attr(X3,X2) ),
    inference(assume_negation,[status(cth)],[synth_qa07_007_mira_news_1295_a19984]) ).

fof(c_0_5,negated_conjecture,
    ! [X8,X9,X10,X11,X12,X13] :
      ( ~ val(X9,bmw_0)
      | ~ subs(X11,n374bernehmen_1_1)
      | ~ sub(X9,name_1_1)
      | ~ sub(X8,firma_1_1)
      | ~ attr(X12,X13)
      | ~ attr(X10,X9) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

cnf(c_0_6,negated_conjecture,
    ( ~ val(X2,bmw_0)
    | ~ subs(X6,n374bernehmen_1_1)
    | ~ sub(X2,name_1_1)
    | ~ sub(X5,firma_1_1)
    | ~ attr(X3,X4)
    | ~ attr(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_7,hypothesis,
    val(c74,bmw_0),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1295_a19984]) ).

cnf(c_0_8,hypothesis,
    sub(c74,name_1_1),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1295_a19984]) ).

cnf(c_0_9,hypothesis,
    ( ~ sub(X5,firma_1_1)
    | ~ subs(X4,n374bernehmen_1_1)
    | ~ attr(X2,X3)
    | ~ attr(X1,c74) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).

cnf(c_0_10,hypothesis,
    attr(c73,c74),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1295_a19984]) ).

fof(c_0_11,plain,
    ! [X21,X22,X23] :
      ( ( ~ subs(X21,X22)
        | ~ chea(X23,X22)
        | subs(esk2_3(X21,X22,X23),X23) )
      & ( ~ subs(X21,X22)
        | ~ chea(X23,X22)
        | chea(esk2_3(X21,X22,X23),X21) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[chea_subs_abs__event])])])])]) ).

cnf(c_0_12,hypothesis,
    ( ~ sub(X4,firma_1_1)
    | ~ subs(X3,n374bernehmen_1_1)
    | ~ attr(X1,X2) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,plain,
    ( ~ subs(X1,X2)
    | ~ chea(X3,X2)
    | subs(esk2_3(X1,X2,X3),X3) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_14,hypothesis,
    ( ~ sub(X5,firma_1_1)
    | ~ subs(X4,X3)
    | ~ chea(n374bernehmen_1_1,X3)
    | ~ attr(X1,X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_15,plain,
    chea(n374bernehmen_1_1,annahme_1_1),
    inference(split_conjunct,[status(thm)],[fact_8354]) ).

cnf(c_0_16,hypothesis,
    ( ~ sub(X4,firma_1_1)
    | ~ subs(X3,annahme_1_1)
    | ~ attr(X1,X2) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_17,hypothesis,
    subs(c25,annahme_1_1),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1295_a19984]) ).

cnf(c_0_18,hypothesis,
    ( ~ sub(X3,firma_1_1)
    | ~ attr(X1,X2) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_19,hypothesis,
    sub(c73,firma_1_1),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1295_a19984]) ).

cnf(c_0_20,hypothesis,
    attr(c18,c19),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1295_a19984]) ).

cnf(c_0_21,hypothesis,
    ~ attr(X1,X2),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : CSR115+50 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.37  % Computer : n001.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Mon Sep 21 15:12:15 UTC 2026
% 0.09/0.38  % CPUTime  : 
% 0.09/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.45  Running first-order theorem proving
% 0.15/0.45  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/benchmark/theBenchmark.p
% 1.65/1.09  % Version: 3.5.1
% 1.65/1.09  % Preprocessing class: FMLLSMSLSSSNFFN.
% 1.65/1.09  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.65/1.09  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.65/1.09  % Starting new_bool_3 with 300s (1) cores
% 1.65/1.09  % Starting new_bool_1 with 300s (1) cores
% 1.65/1.09  % Starting sh5l with 300s (1) cores
% 1.65/1.09  % new_bool_1 with pid 3423409 completed with status 0
% 1.65/1.09  % Result found by new_bool_1
% 1.65/1.09  % Preprocessing class: FMLLSMSLSSSNFFN.
% 1.65/1.09  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.65/1.09  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.65/1.09  % Starting new_bool_3 with 300s (1) cores
% 1.65/1.09  % Starting new_bool_1 with 300s (1) cores
% 1.65/1.09  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.65/1.09  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.65/1.09  % Search class: FHHNF-FFMM33-SFFFFFNN
% 1.65/1.09  % partial match(1): FGHNF-FFMM33-SFFFFFNN
% 1.65/1.09  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.65/1.09  % Starting SubtermCWHack with 31s (1) cores
% 1.65/1.09  % SubtermCWHack with pid 3423411 completed with status 0
% 1.65/1.09  % Result found by SubtermCWHack
% 1.65/1.09  % Preprocessing class: FMLLSMSLSSSNFFN.
% 1.65/1.09  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.65/1.09  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.65/1.09  % Starting new_bool_3 with 300s (1) cores
% 1.65/1.09  % Starting new_bool_1 with 300s (1) cores
% 1.65/1.09  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.65/1.09  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.65/1.09  % Search class: FHHNF-FFMM33-SFFFFFNN
% 1.65/1.09  % partial match(1): FGHNF-FFMM33-SFFFFFNN
% 1.65/1.09  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.65/1.09  % Starting SubtermCWHack with 31s (1) cores
% 1.65/1.09  % Preprocessing time       : 0.018 s
% 1.65/1.09  
% 1.65/1.09  % Proof found!
% 1.65/1.09  % SZS status Theorem
% 1.65/1.09  % SZS output start CNFRefutation
% See solution above
% 1.65/1.09  % Parsed axioms                        : 10189
% 1.65/1.09  % Removed by relevancy pruning/SinE    : 10124
% 1.65/1.09  % Initial clauses                      : 264
% 1.65/1.09  % Removed in clause preprocessing      : 0
% 1.65/1.09  % Initial clauses in saturation        : 264
% 1.65/1.09  % Processed clauses                    : 458
% 1.65/1.09  % ...of these trivial                  : 0
% 1.65/1.09  % ...subsumed                          : 40
% 1.65/1.09  % ...remaining for further processing  : 418
% 1.65/1.09  % Other redundant clauses eliminated   : 0
% 1.65/1.09  % Clauses deleted for lack of memory   : 0
% 1.65/1.09  % Backward-subsumed                    : 8
% 1.65/1.09  % Backward-rewritten                   : 0
% 1.65/1.09  % Generated clauses                    : 395
% 1.65/1.09  % ...of the previous two non-redundant : 378
% 1.65/1.09  % ...aggressively subsumed             : 0
% 1.65/1.09  % Contextual simplify-reflections      : 0
% 1.65/1.09  % Paramodulations                      : 391
% 1.65/1.09  % Factorizations                       : 0
% 1.65/1.09  % NegExts                              : 0
% 1.65/1.09  % Equation resolutions                 : 0
% 1.65/1.09  % Disequality decompositions           : 0
% 1.65/1.09  % Total rewrite steps                  : 1
% 1.65/1.09  % ...of those cached                   : 0
% 1.65/1.09  % Propositional unsat checks           : 0
% 1.65/1.09  %    Propositional check models        : 0
% 1.65/1.09  %    Propositional check unsatisfiable : 0
% 1.65/1.09  %    Propositional clauses             : 0
% 1.65/1.09  %    Propositional clauses after purity: 0
% 1.65/1.09  %    Propositional unsat core size     : 0
% 1.65/1.09  %    Propositional preprocessing time  : 0.000
% 1.65/1.09  %    Propositional encoding time       : 0.000
% 1.65/1.09  %    Propositional solver time         : 0.000
% 1.65/1.09  %    Success case prop preproc time    : 0.000
% 1.65/1.09  %    Success case prop encoding time   : 0.000
% 1.65/1.09  %    Success case prop solver time     : 0.000
% 1.65/1.09  % Current number of processed clauses  : 406
% 1.65/1.09  %    Positive orientable unit clauses  : 256
% 1.65/1.09  %    Positive unorientable unit clauses: 0
% 1.65/1.09  %    Negative unit clauses             : 1
% 1.65/1.09  %    Non-unit-clauses                  : 149
% 1.65/1.09  % Current number of unprocessed clauses: 184
% 1.65/1.09  % ...number of literals in the above   : 840
% 1.65/1.09  % Current number of archived formulas  : 0
% 1.65/1.09  % Current number of archived clauses   : 12
% 1.65/1.09  % Clause-clause subsumption calls (NU) : 7777
% 1.65/1.09  % Rec. Clause-clause subsumption calls : 5304
% 1.65/1.09  % Non-unit clause-clause subsumptions  : 45
% 1.65/1.09  % Unit Clause-clause subsumption calls : 46
% 1.65/1.09  % Rewrite failures with RHS unbound    : 0
% 1.65/1.09  % BW rewrite match attempts            : 0
% 1.65/1.09  % BW rewrite match successes           : 0
% 1.65/1.09  % Condensation attempts                : 0
% 1.65/1.09  % Condensation successes               : 0
% 1.65/1.09  % Termbank termtop insertions          : 56714
% 1.65/1.09  % Search garbage collected termcells   : 39042
% 1.65/1.09  
% 1.65/1.09  % -------------------------------------------------
% 1.65/1.09  % User time                : 0.095 s
% 1.65/1.09  % System time              : 0.080 s
% 1.65/1.09  % Total time               : 0.176 s
% 1.65/1.09  % Maximum resident set size: 44488 pages
% 1.65/1.09  
% 1.65/1.09  % -------------------------------------------------
% 1.65/1.09  % User time                : 0.263 s
% 1.65/1.09  % System time              : 0.119 s
% 1.65/1.09  % Total time               : 0.382 s
% 1.65/1.09  % Maximum resident set size: 13824 pages
% 1.65/1.09  % E exiting
%------------------------------------------------------------------------------