↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR115+51 : 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 : n008.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 2.12s 1.13s
% Output   : CNFRefutation 2.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   17 (   9 unt;   0 def)
%            Number of atoms       :  203 (   0 equ)
%            Maximal formula atoms :  147 (  11 avg)
%            Number of connectives :  218 (  32   ~;  26   |; 160   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :  147 (  13 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   17 (  16 usr;   1 prp; 0-2 aty)
%            Number of functors    :   40 (  40 usr;  40 con; 0-0 aty)
%            Number of variables   :   35 (   6 sgn   6   !;  12   ?)

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

fof(ave07_era5_synth_qa07_007_mira_news_1302_a19984,hypothesis,
    ( sort(rover_0,fe)
    & sort(britisch__1_1,nq)
    & sort(altbew__344hrt_1_1,ql)
    & varia(c219,varia_c)
    & refer(c219,indet)
    & quant(c219,one)
    & gener(c219,sp)
    & fact(c219,real)
    & etype(c219,int0)
    & card(c219,int1)
    & sort(c219,na)
    & sort(bmw_0,fe)
    & sort(m__374nchner_1_1,gq)
    & varia(c166,varia_c)
    & refer(c166,indet)
    & quant(c166,one)
    & gener(c166,sp)
    & fact(c166,real)
    & etype(c166,int0)
    & card(c166,int1)
    & sort(c166,na)
    & gener(n374bernehmen_1_1,ge)
    & fact(n374bernehmen_1_1,real)
    & sort(n374bernehmen_1_1,da)
    & varia(c218,con)
    & refer(c218,det)
    & quant(c218,one)
    & gener(c218,sp)
    & fact(c218,real)
    & etype(c218,int0)
    & card(c218,int1)
    & sort(c218,io)
    & sort(c218,d)
    & varia(c165,con)
    & refer(c165,det)
    & quant(c165,one)
    & gener(c165,sp)
    & fact(c165,real)
    & etype(c165,int0)
    & card(c165,int1)
    & sort(c165,io)
    & sort(c165,d)
    & gener(c163,sp)
    & fact(c163,real)
    & sort(c163,da)
    & sort(m__374nchen_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(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(c1,varia_c)
    & refer(c1,det)
    & quant(c1,one)
    & gener(c1,sp)
    & fact(c1,real)
    & etype(c1,int0)
    & card(c1,int1)
    & sort(c1,na)
    & varia(c0,varia_c)
    & refer(c0,det)
    & quant(c0,one)
    & gener(c0,sp)
    & fact(c0,real)
    & etype(c0,int0)
    & card(c0,int1)
    & sort(c0,io)
    & sort(c0,d)
    & varia(unternehmen_1_1,varia_c)
    & refer(unternehmen_1_1,refer_c)
    & quant(unternehmen_1_1,one)
    & gener(unternehmen_1_1,ge)
    & fact(unternehmen_1_1,real)
    & etype(unternehmen_1_1,int0)
    & card(unternehmen_1_1,int1)
    & sort(unternehmen_1_1,io)
    & sort(unternehmen_1_1,d)
    & varia(autounternehmen_1_1,varia_c)
    & refer(autounternehmen_1_1,refer_c)
    & quant(autounternehmen_1_1,one)
    & gener(autounternehmen_1_1,ge)
    & fact(autounternehmen_1_1,real)
    & etype(autounternehmen_1_1,int0)
    & card(autounternehmen_1_1,int1)
    & sort(autounternehmen_1_1,io)
    & sort(autounternehmen_1_1,d)
    & varia(firmengruppe_1_1,varia_c)
    & refer(firmengruppe_1_1,refer_c)
    & quant(firmengruppe_1_1,one)
    & gener(firmengruppe_1_1,ge)
    & fact(firmengruppe_1_1,real)
    & etype(firmengruppe_1_1,int0)
    & card(firmengruppe_1_1,int1)
    & sort(firmengruppe_1_1,io)
    & sort(firmengruppe_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(autokonzern_1_1,varia_c)
    & refer(autokonzern_1_1,refer_c)
    & quant(autokonzern_1_1,one)
    & gener(autokonzern_1_1,ge)
    & fact(autokonzern_1_1,real)
    & etype(autokonzern_1_1,int0)
    & card(autokonzern_1_1,int1)
    & sort(autokonzern_1_1,io)
    & sort(autokonzern_1_1,d)
    & assoc(m__374nchner_1_1,c0)
    & val(c219,rover_0)
    & sub(c219,name_1_1)
    & sub(c218,autounternehmen_1_1)
    & prop(c218,britisch__1_1)
    & prop(c218,altbew__344hrt_1_1)
    & attr(c218,c219)
    & val(c166,bmw_0)
    & sub(c166,name_1_1)
    & sub(c165,autokonzern_1_1)
    & prop(c165,m__374nchner_1_1)
    & attr(c165,c166)
    & subs(c163,n374bernehmen_1_1)
    & obj(c163,c218)
    & agt(c163,c165)
    & val(c1,m__374nchen_0)
    & sub(c1,name_1_1)
    & sub(c0,stadt__1_1)
    & attr(c0,c1)
    & sub(autounternehmen_1_1,unternehmen_1_1)
    & assoc(autounternehmen_1_1,auto__1_1)
    & sub(autokonzern_1_1,firmengruppe_1_1)
    & assoc(autokonzern_1_1,auto__1_1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ave07_era5_synth_qa07_007_mira_news_1302_a19984) ).

fof(c_0_2,negated_conjecture,
    ~ ? [X1,X2,X3,X4,X5,X6] :
        ( val(X2,bmw_0)
        & subs(X4,n374bernehmen_1_1)
        & sub(X2,name_1_1)
        & prop(X1,britisch__1_1)
        & obj(X4,X1)
        & attr(X5,X6)
        & attr(X3,X2)
        & agt(X4,X3) ),
    inference(assume_negation,[status(cth)],[synth_qa07_007_mira_news_1302_a19984]) ).

fof(c_0_3,negated_conjecture,
    ! [X8,X9,X10,X11,X12,X13] :
      ( ~ val(X9,bmw_0)
      | ~ subs(X11,n374bernehmen_1_1)
      | ~ sub(X9,name_1_1)
      | ~ prop(X8,britisch__1_1)
      | ~ obj(X11,X8)
      | ~ attr(X12,X13)
      | ~ attr(X10,X9)
      | ~ agt(X11,X10) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

cnf(c_0_4,negated_conjecture,
    ( ~ val(X3,bmw_0)
    | ~ subs(X1,n374bernehmen_1_1)
    | ~ sub(X3,name_1_1)
    | ~ prop(X6,britisch__1_1)
    | ~ obj(X1,X6)
    | ~ attr(X4,X5)
    | ~ attr(X2,X3)
    | ~ agt(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_5,hypothesis,
    val(c166,bmw_0),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1302_a19984]) ).

cnf(c_0_6,hypothesis,
    sub(c166,name_1_1),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1302_a19984]) ).

cnf(c_0_7,hypothesis,
    ( ~ subs(X5,n374bernehmen_1_1)
    | ~ obj(X5,X1)
    | ~ agt(X5,X2)
    | ~ attr(X3,X4)
    | ~ attr(X2,c166)
    | ~ prop(X1,britisch__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(c165,c166),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1302_a19984]) ).

cnf(c_0_9,hypothesis,
    ( ~ subs(X4,n374bernehmen_1_1)
    | ~ obj(X4,X1)
    | ~ agt(X4,c165)
    | ~ attr(X2,X3)
    | ~ prop(X1,britisch__1_1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,hypothesis,
    attr(c218,c219),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1302_a19984]) ).

cnf(c_0_11,hypothesis,
    ( ~ subs(X2,n374bernehmen_1_1)
    | ~ obj(X2,X1)
    | ~ agt(X2,c165)
    | ~ prop(X1,britisch__1_1) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_12,hypothesis,
    obj(c163,c218),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1302_a19984]) ).

cnf(c_0_13,hypothesis,
    prop(c218,britisch__1_1),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1302_a19984]) ).

cnf(c_0_14,hypothesis,
    agt(c163,c165),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1302_a19984]) ).

cnf(c_0_15,hypothesis,
    subs(c163,n374bernehmen_1_1),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1302_a19984]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR115+51 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37  % Computer : n008.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Mon Sep 21 15:07:39 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.45  Running first-order theorem proving
% 0.16/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
% 2.12/1.13  % Version: 3.5.1
% 2.12/1.13  % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.12/1.13  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.12/1.13  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.12/1.13  % Starting new_bool_3 with 300s (1) cores
% 2.12/1.13  % Starting new_bool_1 with 300s (1) cores
% 2.12/1.13  % Starting sh5l with 300s (1) cores
% 2.12/1.13  % new_bool_1 with pid 1263087 completed with status 0
% 2.12/1.13  % Result found by new_bool_1
% 2.12/1.13  % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.12/1.13  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.12/1.13  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.12/1.13  % Starting new_bool_3 with 300s (1) cores
% 2.12/1.13  % Starting new_bool_1 with 300s (1) cores
% 2.12/1.13  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.12/1.13  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.12/1.13  % Search class: FHHNF-FFMM33-SFFFFFNN
% 2.12/1.13  % partial match(1): FGHNF-FFMM33-SFFFFFNN
% 2.12/1.13  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.12/1.13  % Starting SubtermCWHack with 31s (1) cores
% 2.12/1.13  % SubtermCWHack with pid 1263094 completed with status 0
% 2.12/1.13  % Result found by SubtermCWHack
% 2.12/1.13  % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.12/1.13  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.12/1.13  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.12/1.13  % Starting new_bool_3 with 300s (1) cores
% 2.12/1.13  % Starting new_bool_1 with 300s (1) cores
% 2.12/1.13  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.12/1.13  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.12/1.13  % Search class: FHHNF-FFMM33-SFFFFFNN
% 2.12/1.13  % partial match(1): FGHNF-FFMM33-SFFFFFNN
% 2.12/1.13  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.12/1.13  % Starting SubtermCWHack with 31s (1) cores
% 2.12/1.13  % Preprocessing time       : 0.020 s
% 2.12/1.13  
% 2.12/1.13  % Proof found!
% 2.12/1.13  % SZS status Theorem
% 2.12/1.13  % SZS output start CNFRefutation
% See solution above
% 2.12/1.13  % Parsed axioms                        : 10189
% 2.12/1.13  % Removed by relevancy pruning/SinE    : 10130
% 2.12/1.13  % Initial clauses                      : 225
% 2.12/1.13  % Removed in clause preprocessing      : 0
% 2.12/1.13  % Initial clauses in saturation        : 225
% 2.12/1.13  % Processed clauses                    : 674
% 2.12/1.13  % ...of these trivial                  : 0
% 2.12/1.13  % ...subsumed                          : 253
% 2.12/1.13  % ...remaining for further processing  : 421
% 2.12/1.13  % Other redundant clauses eliminated   : 0
% 2.12/1.13  % Clauses deleted for lack of memory   : 0
% 2.12/1.13  % Backward-subsumed                    : 1
% 2.12/1.13  % Backward-rewritten                   : 0
% 2.12/1.13  % Generated clauses                    : 872
% 2.12/1.13  % ...of the previous two non-redundant : 844
% 2.12/1.13  % ...aggressively subsumed             : 0
% 2.12/1.13  % Contextual simplify-reflections      : 2
% 2.12/1.13  % Paramodulations                      : 872
% 2.12/1.13  % Factorizations                       : 0
% 2.12/1.13  % NegExts                              : 0
% 2.12/1.13  % Equation resolutions                 : 0
% 2.12/1.13  % Disequality decompositions           : 0
% 2.12/1.13  % Total rewrite steps                  : 4
% 2.12/1.13  % ...of those cached                   : 0
% 2.12/1.13  % Propositional unsat checks           : 0
% 2.12/1.13  %    Propositional check models        : 0
% 2.12/1.13  %    Propositional check unsatisfiable : 0
% 2.12/1.13  %    Propositional clauses             : 0
% 2.12/1.13  %    Propositional clauses after purity: 0
% 2.12/1.13  %    Propositional unsat core size     : 0
% 2.12/1.13  %    Propositional preprocessing time  : 0.000
% 2.12/1.13  %    Propositional encoding time       : 0.000
% 2.12/1.13  %    Propositional solver time         : 0.000
% 2.12/1.13  %    Success case prop preproc time    : 0.000
% 2.12/1.13  %    Success case prop encoding time   : 0.000
% 2.12/1.13  %    Success case prop solver time     : 0.000
% 2.12/1.13  % Current number of processed clauses  : 420
% 2.12/1.13  %    Positive orientable unit clauses  : 170
% 2.12/1.13  %    Positive unorientable unit clauses: 0
% 2.12/1.13  %    Negative unit clauses             : 0
% 2.12/1.13  %    Non-unit-clauses                  : 250
% 2.12/1.13  % Current number of unprocessed clauses: 392
% 2.12/1.13  % ...number of literals in the above   : 2106
% 2.12/1.13  % Current number of archived formulas  : 0
% 2.12/1.13  % Current number of archived clauses   : 1
% 2.12/1.13  % Clause-clause subsumption calls (NU) : 25106
% 2.12/1.13  % Rec. Clause-clause subsumption calls : 10431
% 2.12/1.13  % Non-unit clause-clause subsumptions  : 256
% 2.12/1.13  % Unit Clause-clause subsumption calls : 0
% 2.12/1.13  % Rewrite failures with RHS unbound    : 0
% 2.12/1.13  % BW rewrite match attempts            : 0
% 2.12/1.13  % BW rewrite match successes           : 0
% 2.12/1.13  % Condensation attempts                : 0
% 2.12/1.13  % Condensation successes               : 0
% 2.12/1.13  % Termbank termtop insertions          : 63766
% 2.12/1.13  % Search garbage collected termcells   : 39059
% 2.12/1.13  
% 2.12/1.13  % -------------------------------------------------
% 2.12/1.13  % User time                : 0.166 s
% 2.12/1.13  % System time              : 0.122 s
% 2.12/1.13  % Total time               : 0.288 s
% 2.12/1.13  % Maximum resident set size: 44976 pages
% 2.12/1.13  
% 2.12/1.13  % -------------------------------------------------
% 2.12/1.13  % User time                : 0.337 s
% 2.12/1.13  % System time              : 0.162 s
% 2.12/1.13  % Total time               : 0.499 s
% 2.12/1.13  % Maximum resident set size: 14080 pages
% 2.12/1.13  % E exiting
%------------------------------------------------------------------------------