↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n016.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:04 PM UTC 2026

% Result   : Theorem 0.16s 5.73s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   13 (   7 unt;   0 def)
%            Number of atoms       :  138 (   0 equ)
%            Maximal formula atoms :  108 (  10 avg)
%            Number of connectives :  140 (  15   ~;  10   |; 115   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :  108 (  12 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   19 (  18 usr;   1 prp; 0-2 aty)
%            Number of functors    :   40 (  40 usr;  40 con; 0-0 aty)
%            Number of variables   :   21 (   6 sgn   4   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(synth_qa07_004_mw3_158,conjecture,
    ? [X1,X2,X3,X4] :
      ( val(X2,rom_0)
      & sub(X1,stadt__1_1)
      & sub(X2,name_1_1)
      & scar(X4,X3)
      & attr(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',synth_qa07_004_mw3_158) ).

fof(ave07_era5_synth_qa07_004_mw3_158,hypothesis,
    ( sort(rom_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(c820,varia_c)
    & refer(c820,indet)
    & quant(c820,one)
    & gener(c820,sp)
    & fact(c820,real)
    & etype(c820,int0)
    & card(c820,int1)
    & sort(c820,na)
    & varia(provinz_1_1,varia_c)
    & refer(provinz_1_1,refer_c)
    & quant(provinz_1_1,one)
    & gener(provinz_1_1,ge)
    & fact(provinz_1_1,real)
    & etype(provinz_1_1,int0)
    & card(provinz_1_1,int1)
    & sort(provinz_1_1,io)
    & sort(provinz_1_1,d)
    & gener(geh__366ren_1_1,ge)
    & fact(geh__366ren_1_1,real)
    & sort(geh__366ren_1_1,st)
    & varia(c819,con)
    & refer(c819,det)
    & quant(c819,one)
    & gener(c819,sp)
    & fact(c819,real)
    & etype(c819,int0)
    & card(c819,int1)
    & sort(c819,io)
    & sort(c819,d)
    & varia(c814,con)
    & refer(c814,det)
    & quant(c814,one)
    & gener(c814,sp)
    & fact(c814,real)
    & etype(c814,int0)
    & card(c814,int1)
    & sort(c814,io)
    & sort(c814,d)
    & gener(c672,sp)
    & fact(c672,real)
    & sort(c672,st)
    & varia(bewohner__1_1,varia_c)
    & refer(bewohner__1_1,refer_c)
    & quant(bewohner__1_1,one)
    & gener(bewohner__1_1,ge)
    & fact(bewohner__1_1,real)
    & etype(bewohner__1_1,int0)
    & card(bewohner__1_1,int1)
    & sort(bewohner__1_1,d)
    & gener(haben_1_1,ge)
    & fact(haben_1_1,real)
    & sort(haben_1_1,st)
    & varia(c43,varia_c)
    & refer(c43,det)
    & quant(c43,quant_c)
    & gener(c43,sp)
    & fact(c43,real)
    & etype(c43,etype_c)
    & card(c43,card_c)
    & sort(c43,re)
    & sort(c43,ta)
    & sort(c43,mo)
    & sort(c43,io)
    & sort(c43,co)
    & sort(c43,abs)
    & varia(c660,varia_c)
    & refer(c660,indet)
    & quant(c660,nfquant)
    & gener(c660,sp)
    & fact(c660,real)
    & etype(c660,int1)
    & card(c660,int35895)
    & sort(c660,d)
    & gener(c657,sp)
    & fact(c657,real)
    & sort(c657,st)
    & val(c820,rom_0)
    & sub(c820,name_1_1)
    & sub(c819,stadt__1_1)
    & attr(c819,c820)
    & sub(c814,provinz_1_1)
    & subs(c672,geh__366ren_1_1)
    & sspe(c672,c819)
    & semrel(c672,c657)
    & scar(c672,c43)
    & assoc(c672,c814)
    & pred(c660,bewohner__1_1)
    & subs(c657,haben_1_1)
    & scar(c657,c43)
    & obj(c657,c660) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ave07_era5_synth_qa07_004_mw3_158) ).

fof(c_0_2,negated_conjecture,
    ~ ? [X1,X2,X3,X4] :
        ( val(X2,rom_0)
        & sub(X1,stadt__1_1)
        & sub(X2,name_1_1)
        & scar(X4,X3)
        & attr(X1,X2) ),
    inference(assume_negation,[status(cth)],[synth_qa07_004_mw3_158]) ).

fof(c_0_3,negated_conjecture,
    ! [X8,X9,X10,X11] :
      ( ~ val(X9,rom_0)
      | ~ sub(X8,stadt__1_1)
      | ~ sub(X9,name_1_1)
      | ~ scar(X11,X10)
      | ~ attr(X8,X9) ),
    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(X2,rom_0)
    | ~ sub(X1,stadt__1_1)
    | ~ sub(X2,name_1_1)
    | ~ scar(X3,X4)
    | ~ attr(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_5,hypothesis,
    val(c820,rom_0),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_mw3_158]) ).

cnf(c_0_6,hypothesis,
    sub(c820,name_1_1),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_mw3_158]) ).

cnf(c_0_7,hypothesis,
    ( ~ sub(X1,stadt__1_1)
    | ~ scar(X2,X3)
    | ~ attr(X1,c820) ),
    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(c819,c820),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_mw3_158]) ).

cnf(c_0_9,hypothesis,
    sub(c819,stadt__1_1),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_mw3_158]) ).

cnf(c_0_10,hypothesis,
    scar(c657,c43),
    inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_mw3_158]) ).

cnf(c_0_11,hypothesis,
    ~ scar(X1,X2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR114+16 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/5.38  % Computer : n016.cluster.edu
% 0.12/5.38  % Model    : x86_64 x86_64
% 0.12/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38  % Memory   : 8046.5625MB
% 0.12/5.38  % OS       : Linux 6.8.0-71-generic
% 0.12/5.38  % CPULimit : 300
% 0.12/5.38  % WCLimit  : 300
% 0.12/5.38  % DateTime : Mon Sep 21 15:09:31 UTC 2026
% 0.12/5.38  % CPUTime  : 
% 0.12/5.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/5.43  Running first-order theorem proving
% 0.16/5.43  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
% 0.16/5.73  % Version: 3.5.1
% 0.16/5.73  % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.16/5.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.73  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.16/5.73  % Starting new_bool_3 with 300s (1) cores
% 0.16/5.73  % Starting new_bool_1 with 300s (1) cores
% 0.16/5.73  % Starting sh5l with 300s (1) cores
% 0.16/5.73  % new_bool_1 with pid 2705730 completed with status 0
% 0.16/5.73  % Result found by new_bool_1
% 0.16/5.73  % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.16/5.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.73  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.16/5.73  % Starting new_bool_3 with 300s (1) cores
% 0.16/5.73  % Starting new_bool_1 with 300s (1) cores
% 0.16/5.73  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.73  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.73  % Search class: FHHNF-FFMM33-SFFFFFNN
% 0.16/5.73  % partial match(1): FGHNF-FFMM33-SFFFFFNN
% 0.16/5.73  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.73  % Starting SubtermCWHack with 31s (1) cores
% 0.16/5.73  % SubtermCWHack with pid 2705737 completed with status 0
% 0.16/5.73  % Result found by SubtermCWHack
% 0.16/5.73  % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.16/5.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.73  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.16/5.73  % Starting new_bool_3 with 300s (1) cores
% 0.16/5.73  % Starting new_bool_1 with 300s (1) cores
% 0.16/5.73  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.73  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.73  % Search class: FHHNF-FFMM33-SFFFFFNN
% 0.16/5.73  % partial match(1): FGHNF-FFMM33-SFFFFFNN
% 0.16/5.73  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.73  % Starting SubtermCWHack with 31s (1) cores
% 0.16/5.73  % Preprocessing time       : 0.014 s
% 0.16/5.73  
% 0.16/5.73  % Proof found!
% 0.16/5.73  % SZS status Theorem
% 0.16/5.73  % SZS output start CNFRefutation
% See solution above
% 0.16/5.73  % Parsed axioms                        : 10189
% 0.16/5.73  % Removed by relevancy pruning/SinE    : 10131
% 0.16/5.73  % Initial clauses                      : 175
% 0.16/5.73  % Removed in clause preprocessing      : 0
% 0.16/5.73  % Initial clauses in saturation        : 175
% 0.16/5.73  % Processed clauses                    : 244
% 0.16/5.73  % ...of these trivial                  : 0
% 0.16/5.73  % ...subsumed                          : 6
% 0.16/5.73  % ...remaining for further processing  : 238
% 0.16/5.73  % Other redundant clauses eliminated   : 0
% 0.16/5.73  % Clauses deleted for lack of memory   : 0
% 0.16/5.73  % Backward-subsumed                    : 2
% 0.16/5.73  % Backward-rewritten                   : 0
% 0.16/5.73  % Generated clauses                    : 139
% 0.16/5.73  % ...of the previous two non-redundant : 134
% 0.16/5.73  % ...aggressively subsumed             : 0
% 0.16/5.73  % Contextual simplify-reflections      : 0
% 0.16/5.73  % Paramodulations                      : 137
% 0.16/5.73  % Factorizations                       : 0
% 0.16/5.73  % NegExts                              : 0
% 0.16/5.73  % Equation resolutions                 : 0
% 0.16/5.73  % Disequality decompositions           : 0
% 0.16/5.73  % Total rewrite steps                  : 2
% 0.16/5.73  % ...of those cached                   : 0
% 0.16/5.73  % Propositional unsat checks           : 0
% 0.16/5.73  %    Propositional check models        : 0
% 0.16/5.73  %    Propositional check unsatisfiable : 0
% 0.16/5.73  %    Propositional clauses             : 0
% 0.16/5.73  %    Propositional clauses after purity: 0
% 0.16/5.73  %    Propositional unsat core size     : 0
% 0.16/5.73  %    Propositional preprocessing time  : 0.000
% 0.16/5.73  %    Propositional encoding time       : 0.000
% 0.16/5.73  %    Propositional solver time         : 0.000
% 0.16/5.73  %    Success case prop preproc time    : 0.000
% 0.16/5.73  %    Success case prop encoding time   : 0.000
% 0.16/5.73  %    Success case prop solver time     : 0.000
% 0.16/5.73  % Current number of processed clauses  : 234
% 0.16/5.73  %    Positive orientable unit clauses  : 154
% 0.16/5.73  %    Positive unorientable unit clauses: 0
% 0.16/5.73  %    Negative unit clauses             : 1
% 0.16/5.73  %    Non-unit-clauses                  : 79
% 0.16/5.73  % Current number of unprocessed clauses: 65
% 0.16/5.73  % ...number of literals in the above   : 260
% 0.16/5.73  % Current number of archived formulas  : 0
% 0.16/5.73  % Current number of archived clauses   : 4
% 0.16/5.73  % Clause-clause subsumption calls (NU) : 1873
% 0.16/5.73  % Rec. Clause-clause subsumption calls : 1621
% 0.16/5.73  % Non-unit clause-clause subsumptions  : 6
% 0.16/5.73  % Unit Clause-clause subsumption calls : 87
% 0.16/5.73  % Rewrite failures with RHS unbound    : 0
% 0.16/5.73  % BW rewrite match attempts            : 0
% 0.16/5.73  % BW rewrite match successes           : 0
% 0.16/5.73  % Condensation attempts                : 0
% 0.16/5.73  % Condensation successes               : 0
% 0.16/5.73  % Termbank termtop insertions          : 50756
% 0.16/5.73  % Search garbage collected termcells   : 38941
% 0.16/5.73  
% 0.16/5.73  % -------------------------------------------------
% 0.16/5.73  % User time                : 0.081 s
% 0.16/5.73  % System time              : 0.065 s
% 0.16/5.73  % Total time               : 0.146 s
% 0.16/5.73  % Maximum resident set size: 45216 pages
% 0.16/5.73  
% 0.16/5.73  % -------------------------------------------------
% 0.16/5.73  % User time                : 0.167 s
% 0.16/5.73  % System time              : 0.089 s
% 0.16/5.73  % Total time               : 0.256 s
% 0.16/5.73  % Maximum resident set size: 14336 pages
% 0.16/5.73  % E exiting
%------------------------------------------------------------------------------