%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR113+1 : 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 : n013.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:00 PM UTC 2026
% Result : Theorem 1.16s 1.15s
% Output : CNFRefutation 1.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 7 unt; 0 def)
% Number of atoms : 257 ( 0 equ)
% Maximal formula atoms : 164 ( 9 avg)
% Number of connectives : 284 ( 53 ~; 46 |; 183 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 164 ( 11 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 26 ( 25 usr; 1 prp; 0-2 aty)
% Number of functors : 51 ( 51 usr; 49 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn 13 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_003_insicht_3,conjecture,
? [X1,X2,X3,X4,X5] :
( val(X2,new_york_0)
& subs(X4,stehen_1_1)
& sub(X5,freiheitsstatue_1_1)
& sub(X2,name_1_1)
& scar(X4,X5)
& loc(X4,X1)
& attr(X3,X2)
& flp(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',synth_qa07_003_insicht_3) ).
fof(ave07_era5_synth_qa07_003_insicht_3,hypothesis,
( varia(statue_1_1,varia_c)
& refer(statue_1_1,refer_c)
& quant(statue_1_1,one)
& gener(statue_1_1,ge)
& fact(statue_1_1,real)
& etype(statue_1_1,int0)
& card(statue_1_1,int1)
& sort(statue_1_1,d)
& varia(freiheit_1_1,varia_c)
& refer(freiheit_1_1,refer_c)
& quant(freiheit_1_1,one)
& gener(freiheit_1_1,ge)
& fact(freiheit_1_1,real)
& etype(freiheit_1_1,int0)
& card(freiheit_1_1,int1)
& sort(freiheit_1_1,io)
& sort(freiheit_1_1,as)
& gener(propr_0,gener_c)
& fact(propr_0,real)
& sort(propr_0,st)
& gener(c54,sp)
& fact(c54,real)
& sort(c54,st)
& sort(new_york_0,fe)
& varia(c49,varia_c)
& refer(c49,indet)
& quant(c49,one)
& gener(c49,sp)
& fact(c49,real)
& etype(c49,int0)
& card(c49,int1)
& sort(c49,na)
& varia(c48,con)
& refer(c48,det)
& quant(c48,one)
& gener(c48,sp)
& fact(c48,real)
& etype(c48,int0)
& card(c48,int1)
& sort(c48,io)
& sort(c48,d)
& varia(c57,con)
& refer(c57,det)
& quant(c57,one)
& gener(c57,sp)
& fact(c57,real)
& etype(c57,int0)
& card(c57,int1)
& sort(c57,l)
& varia(c41,con)
& refer(c41,det)
& quant(c41,one)
& gener(c41,sp)
& fact(c41,real)
& etype(c41,int0)
& card(c41,int1)
& sort(c41,d)
& varia(gr__366__337e_1_1,varia_c)
& refer(gr__366__337e_1_1,refer_c)
& quant(gr__366__337e_1_1,one)
& gener(gr__366__337e_1_1,ge)
& fact(gr__366__337e_1_1,real)
& etype(gr__366__337e_1_1,int0)
& card(gr__366__337e_1_1,int1)
& sort(gr__366__337e_1_1,oa)
& varia(c36,con)
& refer(c36,det)
& quant(c36,mult)
& gener(c36,sp)
& fact(c36,real)
& etype(c36,int1)
& card(c36,cons(x_constant,cons(int1,nil)))
& sort(c36,oa)
& sort(gleich_1_1,rq)
& varia(freiheitsstatue_1_1,varia_c)
& refer(freiheitsstatue_1_1,refer_c)
& quant(freiheitsstatue_1_1,one)
& gener(freiheitsstatue_1_1,ge)
& fact(freiheitsstatue_1_1,real)
& etype(freiheitsstatue_1_1,int0)
& card(freiheitsstatue_1_1,int1)
& sort(freiheitsstatue_1_1,d)
& sort(paris_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(c14,varia_c)
& refer(c14,indet)
& quant(c14,one)
& gener(c14,sp)
& fact(c14,real)
& etype(c14,int0)
& card(c14,int1)
& sort(c14,na)
& varia(c13,con)
& refer(c13,det)
& quant(c13,one)
& gener(c13,sp)
& fact(c13,real)
& etype(c13,int0)
& card(c13,int1)
& sort(c13,io)
& sort(c13,d)
& gener(befinden_1_2,ge)
& fact(befinden_1_2,real)
& sort(befinden_1_2,st)
& varia(c18,varia_c)
& refer(c18,indet)
& quant(c18,nfquant)
& gener(c18,sp)
& fact(c18,real)
& etype(c18,int1)
& card(c18,int4)
& sort(c18,d)
& varia(c59,con)
& refer(c59,det)
& quant(c59,one)
& gener(c59,sp)
& fact(c59,real)
& etype(c59,int0)
& card(c59,int1)
& sort(c59,l)
& gener(c11,sp)
& fact(c11,real)
& sort(c11,st)
& sub(freiheitsstatue_1_1,statue_1_1)
& assoc(freiheitsstatue_1_1,freiheit_1_1)
& in(c59,c13)
& in(c57,c48)
& subr(c54,propr_0)
& instr(c54,c41)
& assoc(c54,c36)
& arg2(c54,gleich_1_1)
& arg1(c54,c18)
& val(c49,new_york_0)
& sub(c49,name_1_1)
& sub(c48,stadt__1_1)
& attr(c48,c49)
& sub(c41,freiheitsstatue_1_1)
& loc(c41,c57)
& pred(c36,gr__366__337e_1_1)
& propr(c18,gleich_1_1)
& pred(c18,freiheitsstatue_1_1)
& val(c14,paris_0)
& sub(c14,name_1_1)
& sub(c13,stadt__1_1)
& attr(c13,c14)
& subs(c11,befinden_1_2)
& scar(c11,c18)
& loc(c11,c59) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ave07_era5_synth_qa07_003_insicht_3) ).
fof(local_function___flp,axiom,
! [X1,X2] :
( ( bei(X1,X2)
| an(X1,X2)
| in(X1,X2) )
=> flp(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR004+0.ax',local_function___flp) ).
fof(loc__stehen_1_1_loc,axiom,
! [X1,X2] :
( loc(X1,X2)
=> ? [X3] :
( subs(X3,stehen_1_1)
& scar(X3,X1)
& loc(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR004+0.ax',loc__stehen_1_1_loc) ).
fof(c_0_4,negated_conjecture,
~ ? [X1,X2,X3,X4,X5] :
( val(X2,new_york_0)
& subs(X4,stehen_1_1)
& sub(X5,freiheitsstatue_1_1)
& sub(X2,name_1_1)
& scar(X4,X5)
& loc(X4,X1)
& attr(X3,X2)
& flp(X1,X3) ),
inference(assume_negation,[status(cth)],[synth_qa07_003_insicht_3]) ).
fof(c_0_5,negated_conjecture,
! [X8,X9,X10,X11,X12] :
( ~ val(X9,new_york_0)
| ~ subs(X11,stehen_1_1)
| ~ sub(X12,freiheitsstatue_1_1)
| ~ sub(X9,name_1_1)
| ~ scar(X11,X12)
| ~ loc(X11,X8)
| ~ attr(X10,X9)
| ~ flp(X8,X10) ),
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(X3,new_york_0)
| ~ subs(X4,stehen_1_1)
| ~ sub(X5,freiheitsstatue_1_1)
| ~ sub(X3,name_1_1)
| ~ scar(X4,X5)
| ~ loc(X4,X1)
| ~ attr(X2,X3)
| ~ flp(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,hypothesis,
val(c49,new_york_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_insicht_3]) ).
cnf(c_0_8,hypothesis,
sub(c49,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_insicht_3]) ).
fof(c_0_9,plain,
! [X42,X43] :
( ( flp(X42,X43)
| ~ bei(X42,X43) )
& ( flp(X42,X43)
| ~ an(X42,X43) )
& ( flp(X42,X43)
| ~ in(X42,X43) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[local_function___flp])])])]) ).
cnf(c_0_10,hypothesis,
( ~ sub(X4,freiheitsstatue_1_1)
| ~ subs(X3,stehen_1_1)
| ~ loc(X3,X2)
| ~ scar(X3,X4)
| ~ flp(X2,X1)
| ~ attr(X1,c49) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).
cnf(c_0_11,plain,
( ~ in(X1,X2)
| flp(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,hypothesis,
( ~ sub(X4,freiheitsstatue_1_1)
| ~ subs(X3,stehen_1_1)
| ~ loc(X3,X1)
| ~ scar(X3,X4)
| ~ attr(X2,c49)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,hypothesis,
attr(c48,c49),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_insicht_3]) ).
cnf(c_0_14,hypothesis,
( ~ sub(X3,freiheitsstatue_1_1)
| ~ subs(X2,stehen_1_1)
| ~ loc(X2,X1)
| ~ scar(X2,X3)
| ~ in(X1,c48) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,hypothesis,
in(c57,c48),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_insicht_3]) ).
fof(c_0_16,plain,
! [X24,X25] :
( ( ~ loc(X24,X25)
| subs(esk3_2(X24,X25),stehen_1_1) )
& ( ~ loc(X24,X25)
| scar(esk3_2(X24,X25),X24) )
& ( ~ loc(X24,X25)
| loc(esk3_2(X24,X25),X25) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[loc__stehen_1_1_loc])])])])]) ).
cnf(c_0_17,hypothesis,
( ~ sub(X2,freiheitsstatue_1_1)
| ~ subs(X1,stehen_1_1)
| ~ loc(X1,c57)
| ~ scar(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( ~ loc(X1,X2)
| scar(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,plain,
( ~ loc(X1,X2)
| subs(esk3_2(X1,X2),stehen_1_1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,hypothesis,
( ~ sub(X1,freiheitsstatue_1_1)
| ~ loc(X1,X2)
| ~ loc(esk3_2(X1,X2),c57) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_21,plain,
( ~ loc(X1,X2)
| loc(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,hypothesis,
( ~ sub(X1,freiheitsstatue_1_1)
| ~ loc(X1,c57) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,hypothesis,
sub(c41,freiheitsstatue_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_insicht_3]) ).
cnf(c_0_24,hypothesis,
loc(c41,c57),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_insicht_3]) ).
cnf(c_0_25,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR113+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n013.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 15:02:37 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.44 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.16/1.15 % Version: 3.5.1
% 1.16/1.15 % Preprocessing class: FMLLSMSLSSSNFFN.
% 1.16/1.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.16/1.15 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.16/1.15 % Starting new_bool_3 with 300s (1) cores
% 1.16/1.15 % Starting new_bool_1 with 300s (1) cores
% 1.16/1.15 % Starting sh5l with 300s (1) cores
% 1.16/1.15 % new_bool_3 with pid 1035248 completed with status 0
% 1.16/1.15 % Result found by new_bool_3
% 1.16/1.15 % Preprocessing class: FMLLSMSLSSSNFFN.
% 1.16/1.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.16/1.15 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.16/1.15 % Starting new_bool_3 with 300s (1) cores
% 1.16/1.15 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.16/1.15 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.16/1.15 % Search class: FHHNF-FSLM32-SFFFFFNN
% 1.16/1.15 % partial match(1): FGHNF-FSLM32-SFFFFFNN
% 1.16/1.15 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.16/1.15 % Starting SubtermCWHack with 31s (1) cores
% 1.16/1.15 % SubtermCWHack with pid 1035257 completed with status 0
% 1.16/1.15 % Result found by SubtermCWHack
% 1.16/1.15 % Preprocessing class: FMLLSMSLSSSNFFN.
% 1.16/1.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.16/1.15 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.16/1.15 % Starting new_bool_3 with 300s (1) cores
% 1.16/1.15 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.16/1.15 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.16/1.15 % Search class: FHHNF-FSLM32-SFFFFFNN
% 1.16/1.15 % partial match(1): FGHNF-FSLM32-SFFFFFNN
% 1.16/1.15 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.16/1.15 % Starting SubtermCWHack with 31s (1) cores
% 1.16/1.15 % Preprocessing time : 0.024 s
% 1.16/1.15
% 1.16/1.15 % Proof found!
% 1.16/1.15 % SZS status Theorem
% 1.16/1.15 % SZS output start CNFRefutation
% See solution above
% 1.16/1.15 % Parsed axioms : 10189
% 1.16/1.15 % Removed by relevancy pruning/SinE : 10108
% 1.16/1.15 % Initial clauses : 279
% 1.16/1.15 % Removed in clause preprocessing : 0
% 1.16/1.15 % Initial clauses in saturation : 279
% 1.16/1.15 % Processed clauses : 459
% 1.16/1.15 % ...of these trivial : 2
% 1.16/1.15 % ...subsumed : 38
% 1.16/1.15 % ...remaining for further processing : 419
% 1.16/1.15 % Other redundant clauses eliminated : 0
% 1.16/1.15 % Clauses deleted for lack of memory : 0
% 1.16/1.15 % Backward-subsumed : 2
% 1.16/1.15 % Backward-rewritten : 0
% 1.16/1.15 % Generated clauses : 308
% 1.16/1.15 % ...of the previous two non-redundant : 288
% 1.16/1.15 % ...aggressively subsumed : 0
% 1.16/1.15 % Contextual simplify-reflections : 3
% 1.16/1.15 % Paramodulations : 308
% 1.16/1.15 % Factorizations : 0
% 1.16/1.15 % NegExts : 0
% 1.16/1.15 % Equation resolutions : 0
% 1.16/1.15 % Disequality decompositions : 0
% 1.16/1.15 % Total rewrite steps : 6
% 1.16/1.15 % ...of those cached : 0
% 1.16/1.15 % Propositional unsat checks : 0
% 1.16/1.15 % Propositional check models : 0
% 1.16/1.15 % Propositional check unsatisfiable : 0
% 1.16/1.15 % Propositional clauses : 0
% 1.16/1.15 % Propositional clauses after purity: 0
% 1.16/1.15 % Propositional unsat core size : 0
% 1.16/1.15 % Propositional preprocessing time : 0.000
% 1.16/1.15 % Propositional encoding time : 0.000
% 1.16/1.15 % Propositional solver time : 0.000
% 1.16/1.15 % Success case prop preproc time : 0.000
% 1.16/1.15 % Success case prop encoding time : 0.000
% 1.16/1.15 % Success case prop solver time : 0.000
% 1.16/1.15 % Current number of processed clauses : 417
% 1.16/1.15 % Positive orientable unit clauses : 196
% 1.16/1.15 % Positive unorientable unit clauses: 0
% 1.16/1.15 % Negative unit clauses : 0
% 1.16/1.15 % Non-unit-clauses : 221
% 1.16/1.15 % Current number of unprocessed clauses: 108
% 1.16/1.15 % ...number of literals in the above : 557
% 1.16/1.15 % Current number of archived formulas : 0
% 1.16/1.15 % Current number of archived clauses : 2
% 1.16/1.15 % Clause-clause subsumption calls (NU) : 14240
% 1.16/1.15 % Rec. Clause-clause subsumption calls : 8618
% 1.16/1.15 % Non-unit clause-clause subsumptions : 43
% 1.16/1.15 % Unit Clause-clause subsumption calls : 0
% 1.16/1.15 % Rewrite failures with RHS unbound : 0
% 1.16/1.15 % BW rewrite match attempts : 0
% 1.16/1.15 % BW rewrite match successes : 0
% 1.16/1.15 % Condensation attempts : 0
% 1.16/1.15 % Condensation successes : 0
% 1.16/1.15 % Termbank termtop insertions : 59116
% 1.16/1.15 % Search garbage collected termcells : 39309
% 1.16/1.15
% 1.16/1.15 % -------------------------------------------------
% 1.16/1.15 % User time : 0.156 s
% 1.16/1.15 % System time : 0.132 s
% 1.16/1.15 % Total time : 0.288 s
% 1.16/1.15 % Maximum resident set size: 44984 pages
% 1.16/1.15
% 1.16/1.15 % -------------------------------------------------
% 1.16/1.15 % User time : 0.320 s
% 1.16/1.15 % System time : 0.173 s
% 1.16/1.15 % Total time : 0.493 s
% 1.16/1.15 % Maximum resident set size: 14336 pages
% 1.16/1.15 % E exiting
%------------------------------------------------------------------------------