%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR115+75 : 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 : n003.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:17 PM UTC 2026
% Result : Theorem 3.84s 1.21s
% Output : CNFRefutation 3.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 6 unt; 0 def)
% Number of atoms : 240 ( 0 equ)
% Maximal formula atoms : 104 ( 8 avg)
% Number of connectives : 297 ( 84 ~; 72 |; 139 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 104 ( 10 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 23 ( 22 usr; 1 prp; 0-4 aty)
% Number of functors : 49 ( 49 usr; 44 con; 0-3 aty)
% Number of variables : 87 ( 32 sgn 17 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_007_mira_wp_485,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/sandbox/benchmark/theBenchmark.p',synth_qa07_007_mira_wp_485) ).
fof(ave07_era5_synth_qa07_007_mira_wp_485,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(c86,varia_c)
& refer(c86,indet)
& quant(c86,one)
& gener(c86,sp)
& fact(c86,real)
& etype(c86,int0)
& card(c86,int1)
& sort(c86,na)
& varia(c85,con)
& refer(c85,det)
& quant(c85,one)
& gener(c85,sp)
& fact(c85,real)
& etype(c85,int0)
& card(c85,int1)
& sort(c85,io)
& sort(c85,d)
& varia(motor__1_1,varia_c)
& refer(motor__1_1,refer_c)
& quant(motor__1_1,one)
& gener(motor__1_1,ge)
& fact(motor__1_1,real)
& etype(motor__1_1,int0)
& card(motor__1_1,int1)
& sort(motor__1_1,d)
& sort(gleich_1_1,rq)
& varia(l6_1_1,varia_c)
& refer(l6_1_1,refer_c)
& quant(l6_1_1,one)
& gener(l6_1_1,ge)
& fact(l6_1_1,real)
& etype(l6_1_1,int0)
& card(l6_1_1,int1)
& sort(l6_1_1,o)
& varia(beid_2_1,varia_c)
& refer(beid_2_1,refer_c)
& quant(beid_2_1,both)
& gener(beid_2_1,gener_c)
& fact(beid_2_1,real)
& etype(beid_2_1,int1)
& card(beid_2_1,int2)
& sort(beid_2_1,o)
& varia(c72,varia_c)
& refer(c72,indet)
& quant(c72,mult)
& gener(c72,sp)
& fact(c72,real)
& etype(c72,int1)
& card(c72,cons(x_constant,cons(int1,nil)))
& sort(c72,d)
& varia(c69,varia_c)
& refer(c69,refer_c)
& quant(c69,mult)
& gener(c69,gener_c)
& fact(c69,real)
& etype(c69,int1)
& card(c69,cons(x_constant,cons(int1,nil)))
& sort(c69,o)
& varia(c62,varia_c)
& refer(c62,refer_c)
& quant(c62,both)
& gener(c62,gener_c)
& fact(c62,real)
& etype(c62,int3)
& etype(c62,int2)
& etype(c62,int1)
& card(c62,int2)
& sort(c62,o)
& varia(c269,varia_c)
& refer(c269,refer_c)
& quant(c269,quant_c)
& gener(c269,gener_c)
& fact(c269,real)
& etype(c269,etype_c)
& card(c269,card_c)
& sort(c269,ent)
& val(c86,bmw_0)
& sub(c86,name_1_1)
& sub(c85,firma_1_1)
& attr(c85,c86)
& attch(c85,c72)
& pred(c72,motor__1_1)
& propr(c69,gleich_1_1)
& pred(c69,l6_1_1)
& pred(c62,beid_2_1)
& tupl_p4(c269,c62,c69,c72) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ave07_era5_synth_qa07_007_mira_wp_485) ).
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/sandbox/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/sandbox/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_485]) ).
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(c86,bmw_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_485]) ).
cnf(c_0_8,hypothesis,
sub(c86,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_485]) ).
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,c86)
| ~ 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,c86)
| ~ attr(X1,c86) ),
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(c85,c86),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_485]) ).
cnf(c_0_12,hypothesis,
( ~ sub(X1,firma_1_1)
| ~ obj(X4,X1)
| ~ attr(X2,X3)
| ~ attr(X1,c86) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,hypothesis,
sub(c85,firma_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_485]) ).
fof(c_0_14,plain,
! [X297,X298,X299] :
( ( ~ subr(X297,sub_0)
| ~ arg2(X297,X299)
| ~ arg1(X297,X298)
| subs(esk40_3(X297,X298,X299),bezeichnen_1_1) )
& ( ~ subr(X297,sub_0)
| ~ arg2(X297,X299)
| ~ arg1(X297,X298)
| subr(esk41_3(X297,X298,X299),rprs_0) )
& ( ~ subr(X297,sub_0)
| ~ arg2(X297,X299)
| ~ arg1(X297,X298)
| sub(esk42_3(X297,X298,X299),X299) )
& ( ~ subr(X297,sub_0)
| ~ arg2(X297,X299)
| ~ arg1(X297,X298)
| obj(esk40_3(X297,X298,X299),X298) )
& ( ~ subr(X297,sub_0)
| ~ arg2(X297,X299)
| ~ arg1(X297,X298)
| mcont(esk40_3(X297,X298,X299),esk41_3(X297,X298,X299)) )
& ( ~ subr(X297,sub_0)
| ~ arg2(X297,X299)
| ~ arg1(X297,X298)
| hsit(X297,esk40_3(X297,X298,X299)) )
& ( ~ subr(X297,sub_0)
| ~ arg2(X297,X299)
| ~ arg1(X297,X298)
| arg2(esk41_3(X297,X298,X299),esk42_3(X297,X298,X299)) )
& ( ~ subr(X297,sub_0)
| ~ arg2(X297,X299)
| ~ arg1(X297,X298)
| arg1(esk41_3(X297,X298,X299),X298) ) ),
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,c85)
| ~ 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(esk40_3(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X303,X304] :
( ( ~ sub(X303,X304)
| subr(esk43_2(X303,X304),sub_0) )
& ( ~ sub(X303,X304)
| arg2(esk43_2(X303,X304),X304) )
& ( ~ sub(X303,X304)
| arg1(esk43_2(X303,X304),X303) ) ),
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,c85)
| ~ 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(esk43_2(X1,X2),sub_0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,hypothesis,
( ~ sub(X3,X4)
| ~ arg1(esk43_2(X3,X4),c85)
| ~ arg2(esk43_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)
| arg1(esk43_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,hypothesis,
( ~ sub(c85,X3)
| ~ arg2(esk43_2(c85,X3),X4)
| ~ attr(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
( ~ sub(X1,X2)
| arg2(esk43_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,hypothesis,
( ~ sub(c85,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.03 % Problem : CSR115+75 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n003.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 15:09:16 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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
% 3.84/1.21 % Version: 3.5.1
% 3.84/1.21 % Preprocessing class: FMLLSMSLSSSNFFN.
% 3.84/1.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.84/1.21 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.84/1.21 % Starting new_bool_3 with 300s (1) cores
% 3.84/1.21 % Starting new_bool_1 with 300s (1) cores
% 3.84/1.21 % Starting sh5l with 300s (1) cores
% 3.84/1.21 % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 404380 completed with status 0
% 3.84/1.21 % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 3.84/1.21 % Preprocessing class: FMLLSMSLSSSNFFN.
% 3.84/1.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.84/1.21 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.84/1.21 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.84/1.21 % SinE strategy is gf500_h_gu_R04_F100_L20000
% 3.84/1.21 % Search class: FHHNS-FSLM32-MFFFFFNN
% 3.84/1.21 % partial match(2): FHHNS-SMLM32-MFFFFFNN
% 3.84/1.21 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.84/1.21 % Starting SubtermCWHack with 136s (1) cores
% 3.84/1.21 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 3.84/1.21 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 3.84/1.21 % Starting new_bool_3 with 136s (1) cores
% 3.84/1.21 % Starting new_bool_1 with 136s (1) cores
% 3.84/1.21 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 404389 completed with status 0
% 3.84/1.21 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 3.84/1.21 % Preprocessing class: FMLLSMSLSSSNFFN.
% 3.84/1.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.84/1.21 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.84/1.21 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.84/1.21 % SinE strategy is gf500_h_gu_R04_F100_L20000
% 3.84/1.21 % Search class: FHHNS-FSLM32-MFFFFFNN
% 3.84/1.21 % partial match(2): FHHNS-SMLM32-MFFFFFNN
% 3.84/1.21 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.84/1.21 % Starting SubtermCWHack with 136s (1) cores
% 3.84/1.21 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 3.84/1.21 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 3.84/1.21 % Preprocessing time : 0.032 s
% 3.84/1.21 % Presaturation interreduction done
% 3.84/1.21
% 3.84/1.21 % Proof found!
% 3.84/1.21 % SZS status Theorem
% 3.84/1.21 % SZS output start CNFRefutation
% See solution above
% 3.84/1.21 % Parsed axioms : 10189
% 3.84/1.21 % Removed by relevancy pruning/SinE : 9949
% 3.84/1.21 % Initial clauses : 496
% 3.84/1.21 % Removed in clause preprocessing : 0
% 3.84/1.21 % Initial clauses in saturation : 496
% 3.84/1.21 % Processed clauses : 991
% 3.84/1.21 % ...of these trivial : 2
% 3.84/1.21 % ...subsumed : 1
% 3.84/1.21 % ...remaining for further processing : 988
% 3.84/1.21 % Other redundant clauses eliminated : 0
% 3.84/1.21 % Clauses deleted for lack of memory : 0
% 3.84/1.21 % Backward-subsumed : 16
% 3.84/1.21 % Backward-rewritten : 0
% 3.84/1.21 % Generated clauses : 427
% 3.84/1.21 % ...of the previous two non-redundant : 426
% 3.84/1.21 % ...aggressively subsumed : 0
% 3.84/1.21 % Contextual simplify-reflections : 0
% 3.84/1.21 % Paramodulations : 426
% 3.84/1.21 % Factorizations : 0
% 3.84/1.21 % NegExts : 0
% 3.84/1.21 % Equation resolutions : 0
% 3.84/1.21 % Disequality decompositions : 0
% 3.84/1.21 % Total rewrite steps : 6
% 3.84/1.21 % ...of those cached : 2
% 3.84/1.21 % Propositional unsat checks : 0
% 3.84/1.21 % Propositional check models : 0
% 3.84/1.21 % Propositional check unsatisfiable : 0
% 3.84/1.21 % Propositional clauses : 0
% 3.84/1.21 % Propositional clauses after purity: 0
% 3.84/1.21 % Propositional unsat core size : 0
% 3.84/1.21 % Propositional preprocessing time : 0.000
% 3.84/1.21 % Propositional encoding time : 0.000
% 3.84/1.21 % Propositional solver time : 0.000
% 3.84/1.21 % Success case prop preproc time : 0.000
% 3.84/1.21 % Success case prop encoding time : 0.000
% 3.84/1.21 % Success case prop solver time : 0.000
% 3.84/1.21 % Current number of processed clauses : 475
% 3.84/1.21 % Positive orientable unit clauses : 274
% 3.84/1.21 % Positive unorientable unit clauses: 0
% 3.84/1.21 % Negative unit clauses : 1
% 3.84/1.21 % Non-unit-clauses : 200
% 3.84/1.21 % Current number of unprocessed clauses: 427
% 3.84/1.21 % ...number of literals in the above : 1451
% 3.84/1.21 % Current number of archived formulas : 0
% 3.84/1.21 % Current number of archived clauses : 513
% 3.84/1.21 % Clause-clause subsumption calls (NU) : 33980
% 3.84/1.21 % Rec. Clause-clause subsumption calls : 15885
% 3.84/1.21 % Non-unit clause-clause subsumptions : 4
% 3.84/1.21 % Unit Clause-clause subsumption calls : 98
% 3.84/1.21 % Rewrite failures with RHS unbound : 0
% 3.84/1.21 % BW rewrite match attempts : 0
% 3.84/1.21 % BW rewrite match successes : 0
% 3.84/1.21 % Condensation attempts : 0
% 3.84/1.21 % Condensation successes : 0
% 3.84/1.21 % Termbank termtop insertions : 74480
% 3.84/1.21 % Search garbage collected termcells : 40743
% 3.84/1.21
% 3.84/1.21 % -------------------------------------------------
% 3.84/1.21 % User time : 0.236 s
% 3.84/1.21 % System time : 0.162 s
% 3.84/1.21 % Total time : 0.399 s
% 3.84/1.21 % Maximum resident set size: 50148 pages
% 3.84/1.21
% 3.84/1.21 % -------------------------------------------------
% 3.84/1.21 % User time : 1.620 s
% 3.84/1.21 % System time : 0.675 s
% 3.84/1.21 % Total time : 2.295 s
% 3.84/1.21 % Maximum resident set size: 14080 pages
% 3.84/1.21 % E exiting
%------------------------------------------------------------------------------