%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR114+21 : 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 : n009.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:05 PM UTC 2026
% Result : Theorem 0.27s 1.08s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 8 unt; 0 def)
% Number of atoms : 150 ( 0 equ)
% Maximal formula atoms : 74 ( 6 avg)
% Number of connectives : 169 ( 41 ~; 34 |; 93 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 74 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-2 aty)
% Number of functors : 29 ( 29 usr; 28 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn 9 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_004_qapn_68,conjecture,
? [X1,X2,X3,X4,X5] :
( val(X2,rom_0)
& subs(X5,stehen_1_1)
& sub(X4,kolosseum_1_1)
& sub(X1,stadt__1_1)
& sub(X2,name_1_1)
& scar(X5,X4)
& loc(X5,X3)
& attr(X1,X2)
& in(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',synth_qa07_004_qapn_68) ).
fof(ave07_era5_synth_qa07_004_qapn_68,hypothesis,
( varia(kolosseum_1_1,con)
& refer(kolosseum_1_1,det)
& quant(kolosseum_1_1,one)
& gener(kolosseum_1_1,sp)
& fact(kolosseum_1_1,real)
& etype(kolosseum_1_1,int0)
& card(kolosseum_1_1,int1)
& sort(kolosseum_1_1,d)
& varia(c30,con)
& refer(c30,det)
& quant(c30,one)
& gener(c30,sp)
& fact(c30,real)
& etype(c30,int0)
& card(c30,int1)
& sort(c30,l)
& gener(restaurieren_1_1,ge)
& fact(restaurieren_1_1,real)
& sort(restaurieren_1_1,da)
& varia(c5,con)
& refer(c5,det)
& quant(c5,one)
& gener(c5,sp)
& fact(c5,real)
& etype(c5,int0)
& card(c5,int1)
& sort(c5,d)
& gener(c19,sp)
& fact(c19,real)
& sort(c19,da)
& 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(c13,varia_c)
& refer(c13,indet)
& quant(c13,one)
& gener(c13,sp)
& fact(c13,real)
& etype(c13,int0)
& card(c13,int1)
& sort(c13,na)
& varia(c12,con)
& refer(c12,det)
& quant(c12,one)
& gener(c12,sp)
& fact(c12,real)
& etype(c12,int0)
& card(c12,int1)
& sort(c12,io)
& sort(c12,d)
& sub(c5,kolosseum_1_1)
& loc(c5,c30)
& in(c30,c12)
& subs(c19,restaurieren_1_1)
& aff(c19,c5)
& val(c13,rom_0)
& sub(c13,name_1_1)
& sub(c12,stadt__1_1)
& attr(c12,c13) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ave07_era5_synth_qa07_004_qapn_68) ).
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_3,negated_conjecture,
~ ? [X1,X2,X3,X4,X5] :
( val(X2,rom_0)
& subs(X5,stehen_1_1)
& sub(X4,kolosseum_1_1)
& sub(X1,stadt__1_1)
& sub(X2,name_1_1)
& scar(X5,X4)
& loc(X5,X3)
& attr(X1,X2)
& in(X3,X1) ),
inference(assume_negation,[status(cth)],[synth_qa07_004_qapn_68]) ).
fof(c_0_4,negated_conjecture,
! [X8,X9,X10,X11,X12] :
( ~ val(X9,rom_0)
| ~ subs(X12,stehen_1_1)
| ~ sub(X11,kolosseum_1_1)
| ~ sub(X8,stadt__1_1)
| ~ sub(X9,name_1_1)
| ~ scar(X12,X11)
| ~ loc(X12,X10)
| ~ attr(X8,X9)
| ~ in(X10,X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_5,negated_conjecture,
( ~ val(X3,rom_0)
| ~ subs(X4,stehen_1_1)
| ~ sub(X5,kolosseum_1_1)
| ~ sub(X2,stadt__1_1)
| ~ sub(X3,name_1_1)
| ~ scar(X4,X5)
| ~ loc(X4,X1)
| ~ attr(X2,X3)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,hypothesis,
val(c13,rom_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_68]) ).
cnf(c_0_7,hypothesis,
sub(c13,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_68]) ).
cnf(c_0_8,hypothesis,
( ~ sub(X2,stadt__1_1)
| ~ sub(X4,kolosseum_1_1)
| ~ subs(X3,stehen_1_1)
| ~ loc(X3,X1)
| ~ scar(X3,X4)
| ~ attr(X2,c13)
| ~ in(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).
cnf(c_0_9,hypothesis,
in(c30,c12),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_68]) ).
cnf(c_0_10,hypothesis,
attr(c12,c13),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_68]) ).
cnf(c_0_11,hypothesis,
sub(c12,stadt__1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_68]) ).
fof(c_0_12,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_13,hypothesis,
( ~ sub(X2,kolosseum_1_1)
| ~ subs(X1,stehen_1_1)
| ~ loc(X1,c30)
| ~ scar(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_14,plain,
( ~ loc(X1,X2)
| scar(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
( ~ loc(X1,X2)
| subs(esk3_2(X1,X2),stehen_1_1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,hypothesis,
( ~ sub(X1,kolosseum_1_1)
| ~ loc(X1,X2)
| ~ loc(esk3_2(X1,X2),c30) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_17,plain,
( ~ loc(X1,X2)
| loc(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,hypothesis,
( ~ sub(X1,kolosseum_1_1)
| ~ loc(X1,c30) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,hypothesis,
loc(c5,c30),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_68]) ).
cnf(c_0_20,hypothesis,
sub(c5,kolosseum_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_68]) ).
cnf(c_0_21,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : CSR114+21 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n009.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Mon Sep 21 15:04:43 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.52 Running first-order theorem proving
% 0.26/0.52 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
% 0.27/1.08 % Version: 3.5.1
% 0.27/1.08 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.27/1.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/1.08 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.27/1.08 % Starting new_bool_3 with 300s (1) cores
% 0.27/1.08 % Starting new_bool_1 with 300s (1) cores
% 0.27/1.08 % Starting sh5l with 300s (1) cores
% 0.27/1.08 % new_bool_1 with pid 2046138 completed with status 0
% 0.27/1.08 % Result found by new_bool_1
% 0.27/1.08 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.27/1.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/1.08 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.27/1.08 % Starting new_bool_3 with 300s (1) cores
% 0.27/1.08 % Starting new_bool_1 with 300s (1) cores
% 0.27/1.08 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/1.08 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/1.08 % Search class: FHHNF-FFMM32-SFFFFFNN
% 0.27/1.08 % partial match(1): FGHNF-FFMM32-SFFFFFNN
% 0.27/1.08 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/1.08 % Starting SubtermCWHack with 31s (1) cores
% 0.27/1.08 % SubtermCWHack with pid 2046142 completed with status 0
% 0.27/1.08 % Result found by SubtermCWHack
% 0.27/1.08 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.27/1.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/1.08 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.27/1.08 % Starting new_bool_3 with 300s (1) cores
% 0.27/1.08 % Starting new_bool_1 with 300s (1) cores
% 0.27/1.08 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/1.08 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/1.08 % Search class: FHHNF-FFMM32-SFFFFFNN
% 0.27/1.08 % partial match(1): FGHNF-FFMM32-SFFFFFNN
% 0.27/1.08 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/1.08 % Starting SubtermCWHack with 31s (1) cores
% 0.27/1.08 % Preprocessing time : 0.018 s
% 0.27/1.08
% 0.27/1.08 % Proof found!
% 0.27/1.08 % SZS status Theorem
% 0.27/1.08 % SZS output start CNFRefutation
% See solution above
% 0.27/1.08 % Parsed axioms : 10189
% 0.27/1.08 % Removed by relevancy pruning/SinE : 10136
% 0.27/1.08 % Initial clauses : 144
% 0.27/1.08 % Removed in clause preprocessing : 0
% 0.27/1.08 % Initial clauses in saturation : 144
% 0.27/1.08 % Processed clauses : 233
% 0.27/1.08 % ...of these trivial : 0
% 0.27/1.08 % ...subsumed : 10
% 0.27/1.08 % ...remaining for further processing : 223
% 0.27/1.08 % Other redundant clauses eliminated : 0
% 0.27/1.08 % Clauses deleted for lack of memory : 0
% 0.27/1.08 % Backward-subsumed : 0
% 0.27/1.08 % Backward-rewritten : 0
% 0.27/1.08 % Generated clauses : 184
% 0.27/1.08 % ...of the previous two non-redundant : 166
% 0.27/1.08 % ...aggressively subsumed : 0
% 0.27/1.08 % Contextual simplify-reflections : 2
% 0.27/1.08 % Paramodulations : 184
% 0.27/1.08 % Factorizations : 0
% 0.27/1.08 % NegExts : 0
% 0.27/1.08 % Equation resolutions : 0
% 0.27/1.08 % Disequality decompositions : 0
% 0.27/1.08 % Total rewrite steps : 4
% 0.27/1.08 % ...of those cached : 0
% 0.27/1.08 % Propositional unsat checks : 0
% 0.27/1.08 % Propositional check models : 0
% 0.27/1.08 % Propositional check unsatisfiable : 0
% 0.27/1.08 % Propositional clauses : 0
% 0.27/1.08 % Propositional clauses after purity: 0
% 0.27/1.08 % Propositional unsat core size : 0
% 0.27/1.08 % Propositional preprocessing time : 0.000
% 0.27/1.08 % Propositional encoding time : 0.000
% 0.27/1.08 % Propositional solver time : 0.000
% 0.27/1.08 % Success case prop preproc time : 0.000
% 0.27/1.08 % Success case prop encoding time : 0.000
% 0.27/1.08 % Success case prop solver time : 0.000
% 0.27/1.08 % Current number of processed clauses : 223
% 0.27/1.08 % Positive orientable unit clauses : 93
% 0.27/1.08 % Positive unorientable unit clauses: 0
% 0.27/1.08 % Negative unit clauses : 0
% 0.27/1.08 % Non-unit-clauses : 130
% 0.27/1.08 % Current number of unprocessed clauses: 71
% 0.27/1.08 % ...number of literals in the above : 405
% 0.27/1.08 % Current number of archived formulas : 0
% 0.27/1.08 % Current number of archived clauses : 0
% 0.27/1.08 % Clause-clause subsumption calls (NU) : 4493
% 0.27/1.08 % Rec. Clause-clause subsumption calls : 2100
% 0.27/1.08 % Non-unit clause-clause subsumptions : 12
% 0.27/1.08 % Unit Clause-clause subsumption calls : 0
% 0.27/1.08 % Rewrite failures with RHS unbound : 0
% 0.27/1.08 % BW rewrite match attempts : 0
% 0.27/1.08 % BW rewrite match successes : 0
% 0.27/1.08 % Condensation attempts : 0
% 0.27/1.08 % Condensation successes : 0
% 0.27/1.08 % Termbank termtop insertions : 52393
% 0.27/1.08 % Search garbage collected termcells : 39030
% 0.27/1.08
% 0.27/1.08 % -------------------------------------------------
% 0.27/1.08 % User time : 0.089 s
% 0.27/1.08 % System time : 0.122 s
% 0.27/1.08 % Total time : 0.211 s
% 0.27/1.08 % Maximum resident set size: 44948 pages
% 0.27/1.08
% 0.27/1.08 % -------------------------------------------------
% 0.27/1.08 % User time : 0.263 s
% 0.27/1.08 % System time : 0.148 s
% 0.27/1.08 % Total time : 0.411 s
% 0.27/1.08 % Maximum resident set size: 14080 pages
% 0.27/1.08 % E exiting
%------------------------------------------------------------------------------