%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR115+70 : 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 : n020.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:16 PM UTC 2026
% Result : Theorem 2.74s 1.12s
% Output : CNFRefutation 2.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 6 unt; 0 def)
% Number of atoms : 215 ( 0 equ)
% Maximal formula atoms : 79 ( 7 avg)
% Number of connectives : 272 ( 84 ~; 72 |; 114 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 79 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 20 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 36 ( 36 usr; 32 con; 0-3 aty)
% Number of variables : 87 ( 31 sgn 17 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_007_mira_wp_480,conjecture,
? [X1,X2,X3,X4,X5,X6,X7] :
( val(X3,bmw_0)
& val(X2,bmw_0)
& sub(X3,name_1_1)
& sub(X1,firma_1_1)
& sub(X2,name_1_1)
& obj(X5,X1)
& attr(X6,X7)
& attr(X4,X3)
& attr(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',synth_qa07_007_mira_wp_480) ).
fof(ave07_era5_synth_qa07_007_mira_wp_480,hypothesis,
( sort(bmw_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(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(c41,varia_c)
& refer(c41,indet)
& quant(c41,one)
& gener(c41,sp)
& fact(c41,real)
& etype(c41,int0)
& card(c41,int1)
& sort(c41,na)
& varia(c40,con)
& refer(c40,det)
& quant(c40,one)
& gener(c40,sp)
& fact(c40,real)
& etype(c40,int0)
& card(c40,int1)
& sort(c40,io)
& sort(c40,d)
& varia(geschichte_1_1,varia_c)
& refer(geschichte_1_1,refer_c)
& quant(geschichte_1_1,one)
& gener(geschichte_1_1,ge)
& fact(geschichte_1_1,real)
& etype(geschichte_1_1,int0)
& card(geschichte_1_1,int1)
& sort(geschichte_1_1,io)
& sort(geschichte_1_1,d)
& sort(geschichte_1_1,ad)
& gener(behandeln_1_1,ge)
& fact(behandeln_1_1,real)
& sort(behandeln_1_1,st)
& varia(c25,con)
& refer(c25,det)
& quant(c25,one)
& gener(c25,sp)
& fact(c25,hypo)
& etype(c25,int0)
& card(c25,int1)
& sort(c25,io)
& sort(c25,d)
& sort(c25,ad)
& varia(c3,varia_c)
& refer(c3,det)
& quant(c3,one)
& gener(c3,sp)
& fact(c3,real)
& etype(c3,int0)
& card(c3,int1)
& sort(c3,o)
& gener(c11,sp)
& fact(c11,real)
& sort(c11,st)
& val(c41,bmw_0)
& sub(c41,name_1_1)
& sub(c40,firma_1_1)
& attr(c40,c41)
& attch(c40,c25)
& mcont(c3,c25)
& sub(c25,geschichte_1_1)
& subs(c11,behandeln_1_1)
& arg2(c11,c25)
& arg1(c11,c3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ave07_era5_synth_qa07_007_mira_wp_480) ).
fof(sub__bezeichnen_1_1_als,axiom,
! [X1,X2,X3] :
( ( subr(X1,sub_0)
& arg2(X1,X3)
& arg1(X1,X2) )
=> ? [X4,X5,X6] :
( subs(X4,bezeichnen_1_1)
& subr(X5,rprs_0)
& sub(X6,X3)
& obj(X4,X2)
& mcont(X4,X5)
& hsit(X1,X4)
& arg2(X5,X6)
& arg1(X5,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR004+0.ax',sub__bezeichnen_1_1_als) ).
fof(sub__sub_0_expansion,axiom,
! [X1,X2] :
( sub(X1,X2)
=> ? [X3] :
( subr(X3,sub_0)
& arg2(X3,X2)
& arg1(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR004+0.ax',sub__sub_0_expansion) ).
fof(c_0_4,negated_conjecture,
~ ? [X1,X2,X3,X4,X5,X6,X7] :
( val(X3,bmw_0)
& val(X2,bmw_0)
& sub(X3,name_1_1)
& sub(X1,firma_1_1)
& sub(X2,name_1_1)
& obj(X5,X1)
& attr(X6,X7)
& attr(X4,X3)
& attr(X1,X2) ),
inference(assume_negation,[status(cth)],[synth_qa07_007_mira_wp_480]) ).
fof(c_0_5,negated_conjecture,
! [X8,X9,X10,X11,X12,X13,X14] :
( ~ val(X10,bmw_0)
| ~ val(X9,bmw_0)
| ~ sub(X10,name_1_1)
| ~ sub(X8,firma_1_1)
| ~ sub(X9,name_1_1)
| ~ obj(X12,X8)
| ~ attr(X13,X14)
| ~ attr(X11,X10)
| ~ attr(X8,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(X4,bmw_0)
| ~ val(X2,bmw_0)
| ~ sub(X4,name_1_1)
| ~ sub(X1,firma_1_1)
| ~ sub(X2,name_1_1)
| ~ obj(X7,X1)
| ~ attr(X5,X6)
| ~ attr(X3,X4)
| ~ attr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,hypothesis,
val(c41,bmw_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_480]) ).
cnf(c_0_8,hypothesis,
sub(c41,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_480]) ).
cnf(c_0_9,hypothesis,
( ~ sub(X5,firma_1_1)
| ~ sub(X1,name_1_1)
| ~ obj(X6,X5)
| ~ attr(X5,X1)
| ~ attr(X3,X4)
| ~ attr(X2,c41)
| ~ val(X1,bmw_0) ),
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,
( ~ sub(X2,firma_1_1)
| ~ obj(X5,X2)
| ~ attr(X3,X4)
| ~ attr(X2,c41)
| ~ attr(X1,c41) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_7]),c_0_8])]) ).
cnf(c_0_11,hypothesis,
attr(c40,c41),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_480]) ).
cnf(c_0_12,hypothesis,
( ~ sub(X1,firma_1_1)
| ~ obj(X4,X1)
| ~ attr(X2,X3)
| ~ attr(X1,c41) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,hypothesis,
sub(c40,firma_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_480]) ).
fof(c_0_14,plain,
! [X146,X147,X148] :
( ( ~ subr(X146,sub_0)
| ~ arg2(X146,X148)
| ~ arg1(X146,X147)
| subs(esk18_3(X146,X147,X148),bezeichnen_1_1) )
& ( ~ subr(X146,sub_0)
| ~ arg2(X146,X148)
| ~ arg1(X146,X147)
| subr(esk19_3(X146,X147,X148),rprs_0) )
& ( ~ subr(X146,sub_0)
| ~ arg2(X146,X148)
| ~ arg1(X146,X147)
| sub(esk20_3(X146,X147,X148),X148) )
& ( ~ subr(X146,sub_0)
| ~ arg2(X146,X148)
| ~ arg1(X146,X147)
| obj(esk18_3(X146,X147,X148),X147) )
& ( ~ subr(X146,sub_0)
| ~ arg2(X146,X148)
| ~ arg1(X146,X147)
| mcont(esk18_3(X146,X147,X148),esk19_3(X146,X147,X148)) )
& ( ~ subr(X146,sub_0)
| ~ arg2(X146,X148)
| ~ arg1(X146,X147)
| hsit(X146,esk18_3(X146,X147,X148)) )
& ( ~ subr(X146,sub_0)
| ~ arg2(X146,X148)
| ~ arg1(X146,X147)
| arg2(esk19_3(X146,X147,X148),esk20_3(X146,X147,X148)) )
& ( ~ subr(X146,sub_0)
| ~ arg2(X146,X148)
| ~ arg1(X146,X147)
| arg1(esk19_3(X146,X147,X148),X147) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sub__bezeichnen_1_1_als])])])])])]) ).
cnf(c_0_15,hypothesis,
( ~ obj(X3,c40)
| ~ attr(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_11]),c_0_13])]) ).
cnf(c_0_16,plain,
( ~ subr(X1,sub_0)
| ~ arg2(X1,X3)
| ~ arg1(X1,X2)
| obj(esk18_3(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X167,X168] :
( ( ~ sub(X167,X168)
| subr(esk24_2(X167,X168),sub_0) )
& ( ~ sub(X167,X168)
| arg2(esk24_2(X167,X168),X168) )
& ( ~ sub(X167,X168)
| arg1(esk24_2(X167,X168),X167) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sub__sub_0_expansion])])])])]) ).
cnf(c_0_18,hypothesis,
( ~ arg1(X1,c40)
| ~ arg2(X1,X4)
| ~ attr(X2,X3)
| ~ subr(X1,sub_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( ~ sub(X1,X2)
| subr(esk24_2(X1,X2),sub_0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,hypothesis,
( ~ sub(X3,X4)
| ~ arg1(esk24_2(X3,X4),c40)
| ~ arg2(esk24_2(X3,X4),X5)
| ~ attr(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
( ~ sub(X1,X2)
| arg2(esk24_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,hypothesis,
( ~ sub(X3,X4)
| ~ arg1(esk24_2(X3,X4),c40)
| ~ attr(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
( ~ sub(X1,X2)
| arg1(esk24_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,hypothesis,
( ~ sub(c40,X3)
| ~ attr(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,hypothesis,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_13]) ).
cnf(c_0_26,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_11,c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR115+70 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n020.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 15:08:48 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.74/1.12 % Version: 3.5.1
% 2.74/1.12 % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.74/1.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.74/1.12 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.74/1.12 % Starting new_bool_3 with 300s (1) cores
% 2.74/1.12 % Starting new_bool_1 with 300s (1) cores
% 2.74/1.12 % Starting sh5l with 300s (1) cores
% 2.74/1.12 % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 3220949 completed with status 0
% 2.74/1.12 % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 2.74/1.12 % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.74/1.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.74/1.12 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.74/1.12 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.74/1.12 % SinE strategy is gf500_h_gu_R04_F100_L20000
% 2.74/1.12 % Search class: FHHNS-FSLM32-MFFFFFNN
% 2.74/1.12 % partial match(2): FHHNS-SMLM32-MFFFFFNN
% 2.74/1.12 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.74/1.12 % Starting SubtermCWHack with 136s (1) cores
% 2.74/1.12 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 2.74/1.12 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.74/1.12 % Starting new_bool_3 with 136s (1) cores
% 2.74/1.12 % Starting new_bool_1 with 136s (1) cores
% 2.74/1.12 % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 3220957 completed with status 0
% 2.74/1.12 % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 2.74/1.12 % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.74/1.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.74/1.12 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.74/1.12 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.74/1.12 % SinE strategy is gf500_h_gu_R04_F100_L20000
% 2.74/1.12 % Search class: FHHNS-FSLM32-MFFFFFNN
% 2.74/1.12 % partial match(2): FHHNS-SMLM32-MFFFFFNN
% 2.74/1.12 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.74/1.12 % Starting SubtermCWHack with 136s (1) cores
% 2.74/1.12 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 2.74/1.12 % Preprocessing time : 0.029 s
% 2.74/1.12 % Presaturation interreduction done
% 2.74/1.12
% 2.74/1.12 % Proof found!
% 2.74/1.12 % SZS status Theorem
% 2.74/1.12 % SZS output start CNFRefutation
% See solution above
% 2.74/1.12 % Parsed axioms : 10189
% 2.74/1.12 % Removed by relevancy pruning/SinE : 9952
% 2.74/1.12 % Initial clauses : 468
% 2.74/1.12 % Removed in clause preprocessing : 0
% 2.74/1.12 % Initial clauses in saturation : 468
% 2.74/1.12 % Processed clauses : 993
% 2.74/1.12 % ...of these trivial : 0
% 2.74/1.12 % ...subsumed : 31
% 2.74/1.12 % ...remaining for further processing : 962
% 2.74/1.12 % Other redundant clauses eliminated : 0
% 2.74/1.12 % Clauses deleted for lack of memory : 0
% 2.74/1.12 % Backward-subsumed : 18
% 2.74/1.12 % Backward-rewritten : 0
% 2.74/1.12 % Generated clauses : 734
% 2.74/1.12 % ...of the previous two non-redundant : 703
% 2.74/1.12 % ...aggressively subsumed : 0
% 2.74/1.12 % Contextual simplify-reflections : 0
% 2.74/1.12 % Paramodulations : 733
% 2.74/1.12 % Factorizations : 0
% 2.74/1.12 % NegExts : 0
% 2.74/1.12 % Equation resolutions : 0
% 2.74/1.12 % Disequality decompositions : 0
% 2.74/1.12 % Total rewrite steps : 7
% 2.74/1.12 % ...of those cached : 3
% 2.74/1.12 % Propositional unsat checks : 0
% 2.74/1.12 % Propositional check models : 0
% 2.74/1.12 % Propositional check unsatisfiable : 0
% 2.74/1.12 % Propositional clauses : 0
% 2.74/1.12 % Propositional clauses after purity: 0
% 2.74/1.12 % Propositional unsat core size : 0
% 2.74/1.12 % Propositional preprocessing time : 0.000
% 2.74/1.12 % Propositional encoding time : 0.000
% 2.74/1.12 % Propositional solver time : 0.000
% 2.74/1.12 % Success case prop preproc time : 0.000
% 2.74/1.12 % Success case prop encoding time : 0.000
% 2.74/1.12 % Success case prop solver time : 0.000
% 2.74/1.12 % Current number of processed clauses : 475
% 2.74/1.12 % Positive orientable unit clauses : 247
% 2.74/1.12 % Positive unorientable unit clauses: 0
% 2.74/1.12 % Negative unit clauses : 1
% 2.74/1.12 % Non-unit-clauses : 227
% 2.74/1.12 % Current number of unprocessed clauses: 646
% 2.74/1.12 % ...number of literals in the above : 2028
% 2.74/1.12 % Current number of archived formulas : 0
% 2.74/1.12 % Current number of archived clauses : 487
% 2.74/1.12 % Clause-clause subsumption calls (NU) : 34373
% 2.74/1.12 % Rec. Clause-clause subsumption calls : 16981
% 2.74/1.12 % Non-unit clause-clause subsumptions : 33
% 2.74/1.12 % Unit Clause-clause subsumption calls : 109
% 2.74/1.12 % Rewrite failures with RHS unbound : 0
% 2.74/1.12 % BW rewrite match attempts : 0
% 2.74/1.12 % BW rewrite match successes : 0
% 2.74/1.12 % Condensation attempts : 0
% 2.74/1.12 % Condensation successes : 0
% 2.74/1.12 % Termbank termtop insertions : 76418
% 2.74/1.12 % Search garbage collected termcells : 40694
% 2.74/1.12
% 2.74/1.12 % -------------------------------------------------
% 2.74/1.12 % User time : 0.283 s
% 2.74/1.12 % System time : 0.175 s
% 2.74/1.12 % Total time : 0.458 s
% 2.74/1.12 % Maximum resident set size: 50168 pages
% 2.74/1.12
% 2.74/1.12 % -------------------------------------------------
% 2.74/1.12 % User time : 0.976 s
% 2.74/1.12 % System time : 0.568 s
% 2.74/1.12 % Total time : 1.543 s
% 2.74/1.12 % Maximum resident set size: 14080 pages
% 2.74/1.12 % E exiting
%------------------------------------------------------------------------------