TSTP Solution File: CSR114+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR114+4 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 19:15:58 EDT 2024
% Result : Theorem 1.05s 0.57s
% Output : CNFRefutation 1.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 252 ( 0 equ)
% Maximal formula atoms : 171 ( 10 avg)
% Number of connectives : 275 ( 46 ~; 38 |; 190 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 171 ( 12 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 27 ( 26 usr; 1 prp; 0-3 aty)
% Number of functors : 57 ( 57 usr; 56 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 9 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_004_insicht_3,conjecture,
? [X1,X2,X3,X4,X5] :
( in(X3,X1)
& attr(X1,X2)
& loc(X5,X3)
& scar(X5,X4)
& sub(X2,name_1_1)
& sub(X1,stadt__1_1)
& sub(X4,kolosseum_1_1)
& subs(X5,stehen_1_1)
& val(X2,rom_0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',synth_qa07_004_insicht_3) ).
fof(ave07_era5_synth_qa07_004_insicht_3,hypothesis,
( chsp2(bekommen_1_1,c0)
& attch(c12058,c7)
& attr(c12058,c12059)
& sub(c12058,stadt__1_1)
& sub(c12059,name_1_1)
& val(c12059,verona_0)
& modp(c12087,zwei_1_1,c0)
& arg1(c12093,c7)
& arg2(c12093,c12602)
& assoc(c12093,c12583)
& semrel(c12093,c16)
& subr(c12093,equ_0)
& loc(c12583,c12608)
& sub(c12583,kolosseum_1_1)
& attr(c12594,c12595)
& sub(c12594,stadt__1_1)
& sub(c12595,name_1_1)
& val(c12595,rom_0)
& prop(c12602,c0)
& prop(c12602,c12605)
& sub(c12602,amphi_theater_1_1)
& supl(c12605,zweitgro__337_1_1,c12606)
& in(c12608,c12594)
& arg1(c16,c7)
& arg2(c16,c7)
& subr(c16,sub_0)
& equ(c7,c12602)
& prop(c7,c12087)
& prop(c7,r__366misch__1_1)
& sub(c7,amphi_theater_1_1)
& sub(c7,arena__1_1)
& sub(c7,c7)
& sort(bekommen_1_1,dn)
& fact(bekommen_1_1,real)
& gener(bekommen_1_1,ge)
& sort(c0,tq)
& sort(c12058,d)
& sort(c12058,io)
& card(c12058,int1)
& etype(c12058,int0)
& fact(c12058,real)
& gener(c12058,sp)
& quant(c12058,one)
& refer(c12058,det)
& varia(c12058,con)
& sort(c7,d)
& card(c7,int1)
& etype(c7,int0)
& fact(c7,real)
& gener(c7,sp)
& quant(c7,one)
& refer(c7,det)
& varia(c7,con)
& sort(c12059,na)
& card(c12059,int1)
& etype(c12059,int0)
& fact(c12059,real)
& gener(c12059,sp)
& quant(c12059,one)
& refer(c12059,indet)
& varia(c12059,varia_c)
& sort(stadt__1_1,d)
& sort(stadt__1_1,io)
& card(stadt__1_1,int1)
& etype(stadt__1_1,int0)
& fact(stadt__1_1,real)
& gener(stadt__1_1,ge)
& quant(stadt__1_1,one)
& refer(stadt__1_1,refer_c)
& varia(stadt__1_1,varia_c)
& sort(name_1_1,na)
& card(name_1_1,int1)
& etype(name_1_1,int0)
& fact(name_1_1,real)
& gener(name_1_1,ge)
& quant(name_1_1,one)
& refer(name_1_1,refer_c)
& varia(name_1_1,varia_c)
& sort(verona_0,fe)
& sort(c12087,tq)
& sort(zwei_1_1,nq)
& sort(c12093,st)
& fact(c12093,real)
& gener(c12093,sp)
& sort(c12602,co)
& card(c12602,card_c)
& etype(c12602,etype_c)
& fact(c12602,real)
& gener(c12602,sp)
& quant(c12602,quant_c)
& refer(c12602,det)
& varia(c12602,con)
& sort(c12583,d)
& card(c12583,int1)
& etype(c12583,int0)
& fact(c12583,real)
& gener(c12583,sp)
& quant(c12583,one)
& refer(c12583,det)
& varia(c12583,con)
& sort(c16,st)
& fact(c16,real)
& gener(c16,sp)
& sort(equ_0,st)
& fact(equ_0,real)
& gener(equ_0,gener_c)
& sort(c12608,l)
& card(c12608,int1)
& etype(c12608,int0)
& fact(c12608,real)
& gener(c12608,sp)
& quant(c12608,one)
& refer(c12608,det)
& varia(c12608,con)
& sort(kolosseum_1_1,d)
& card(kolosseum_1_1,int1)
& etype(kolosseum_1_1,int0)
& fact(kolosseum_1_1,real)
& gener(kolosseum_1_1,sp)
& quant(kolosseum_1_1,one)
& refer(kolosseum_1_1,det)
& varia(kolosseum_1_1,con)
& sort(c12594,d)
& sort(c12594,io)
& card(c12594,int1)
& etype(c12594,int0)
& fact(c12594,real)
& gener(c12594,sp)
& quant(c12594,one)
& refer(c12594,det)
& varia(c12594,con)
& sort(c12595,na)
& card(c12595,int1)
& etype(c12595,int0)
& fact(c12595,real)
& gener(c12595,sp)
& quant(c12595,one)
& refer(c12595,indet)
& varia(c12595,varia_c)
& sort(rom_0,fe)
& sort(c12605,tq)
& sort(amphi_theater_1_1,o)
& card(amphi_theater_1_1,int1)
& etype(amphi_theater_1_1,int0)
& fact(amphi_theater_1_1,real)
& gener(amphi_theater_1_1,ge)
& quant(amphi_theater_1_1,one)
& refer(amphi_theater_1_1,refer_c)
& varia(amphi_theater_1_1,varia_c)
& sort(zweitgro__337_1_1,mq)
& sort(c12606,o)
& card(c12606,card_c)
& etype(c12606,int1)
& etype(c12606,int2)
& fact(c12606,real)
& gener(c12606,gener_c)
& quant(c12606,quant_c)
& refer(c12606,refer_c)
& varia(c12606,varia_c)
& sort(sub_0,st)
& fact(sub_0,real)
& gener(sub_0,gener_c)
& sort(r__366misch__1_1,tq)
& sort(arena__1_1,d)
& card(arena__1_1,int1)
& etype(arena__1_1,int0)
& fact(arena__1_1,real)
& gener(arena__1_1,ge)
& quant(arena__1_1,one)
& refer(arena__1_1,refer_c)
& varia(arena__1_1,varia_c) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ave07_era5_synth_qa07_004_insicht_3) ).
fof(loc__stehen_1_1_loc,axiom,
! [X1,X2] :
( loc(X1,X2)
=> ? [X3] :
( loc(X3,X2)
& scar(X3,X1)
& subs(X3,stehen_1_1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR004+0.ax',loc__stehen_1_1_loc) ).
fof(c_0_3,negated_conjecture,
~ ? [X1,X2,X3,X4,X5] :
( in(X3,X1)
& attr(X1,X2)
& loc(X5,X3)
& scar(X5,X4)
& sub(X2,name_1_1)
& sub(X1,stadt__1_1)
& sub(X4,kolosseum_1_1)
& subs(X5,stehen_1_1)
& val(X2,rom_0) ),
inference(assume_negation,[status(cth)],[synth_qa07_004_insicht_3]) ).
fof(c_0_4,negated_conjecture,
! [X8,X9,X10,X11,X12] :
( ~ in(X10,X8)
| ~ attr(X8,X9)
| ~ loc(X12,X10)
| ~ scar(X12,X11)
| ~ sub(X9,name_1_1)
| ~ sub(X8,stadt__1_1)
| ~ sub(X11,kolosseum_1_1)
| ~ subs(X12,stehen_1_1)
| ~ val(X9,rom_0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_5,negated_conjecture,
( ~ in(X1,X2)
| ~ attr(X2,X3)
| ~ loc(X4,X1)
| ~ scar(X4,X5)
| ~ sub(X3,name_1_1)
| ~ sub(X2,stadt__1_1)
| ~ sub(X5,kolosseum_1_1)
| ~ subs(X4,stehen_1_1)
| ~ val(X3,rom_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,hypothesis,
val(c12595,rom_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_insicht_3]) ).
cnf(c_0_7,hypothesis,
sub(c12595,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_insicht_3]) ).
cnf(c_0_8,hypothesis,
( ~ in(X1,X2)
| ~ attr(X2,c12595)
| ~ scar(X3,X4)
| ~ loc(X3,X1)
| ~ subs(X3,stehen_1_1)
| ~ sub(X4,kolosseum_1_1)
| ~ sub(X2,stadt__1_1) ),
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,
attr(c12594,c12595),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_insicht_3]) ).
cnf(c_0_10,hypothesis,
sub(c12594,stadt__1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_insicht_3]) ).
cnf(c_0_11,hypothesis,
( ~ in(X1,c12594)
| ~ scar(X2,X3)
| ~ loc(X2,X1)
| ~ subs(X2,stehen_1_1)
| ~ sub(X3,kolosseum_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_12,hypothesis,
in(c12608,c12594),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_insicht_3]) ).
fof(c_0_13,plain,
! [X24,X25] :
( ( loc(esk3_2(X24,X25),X25)
| ~ loc(X24,X25) )
& ( scar(esk3_2(X24,X25),X24)
| ~ loc(X24,X25) )
& ( subs(esk3_2(X24,X25),stehen_1_1)
| ~ loc(X24,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_14,hypothesis,
( ~ scar(X1,X2)
| ~ loc(X1,c12608)
| ~ subs(X1,stehen_1_1)
| ~ sub(X2,kolosseum_1_1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( scar(esk3_2(X1,X2),X1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
( subs(esk3_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,hypothesis,
( ~ loc(esk3_2(X1,X2),c12608)
| ~ loc(X1,X2)
| ~ sub(X1,kolosseum_1_1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_18,plain,
( loc(esk3_2(X1,X2),X2)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,hypothesis,
( ~ loc(X1,c12608)
| ~ sub(X1,kolosseum_1_1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,hypothesis,
loc(c12583,c12608),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_insicht_3]) ).
cnf(c_0_21,hypothesis,
sub(c12583,kolosseum_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_insicht_3]) ).
cnf(c_0_22,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : CSR114+4 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.08 % Command : run_E %s %d THM
% 0.07/0.26 % Computer : n022.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Sun May 19 00:42:52 EDT 2024
% 0.07/0.26 % CPUTime :
% 0.10/0.34 Running first-order theorem proving
% 0.10/0.34 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
% 1.05/0.57 # Version: 3.1.0
% 1.05/0.57 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.05/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.05/0.57 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.05/0.57 # Starting new_bool_3 with 300s (1) cores
% 1.05/0.57 # Starting new_bool_1 with 300s (1) cores
% 1.05/0.57 # Starting sh5l with 300s (1) cores
% 1.05/0.57 # new_bool_1 with pid 26441 completed with status 0
% 1.05/0.57 # Result found by new_bool_1
% 1.05/0.57 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.05/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.05/0.57 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.05/0.57 # Starting new_bool_3 with 300s (1) cores
% 1.05/0.57 # Starting new_bool_1 with 300s (1) cores
% 1.05/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.05/0.57 # Search class: FHHNF-FSLM32-MFFFFFNN
% 1.05/0.57 # partial match(2): FGHSF-FSLM32-MFFFFFNN
% 1.05/0.57 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.05/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 163s (1) cores
% 1.05/0.57 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 26444 completed with status 0
% 1.05/0.57 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.05/0.57 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.05/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.05/0.57 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.05/0.57 # Starting new_bool_3 with 300s (1) cores
% 1.05/0.57 # Starting new_bool_1 with 300s (1) cores
% 1.05/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.05/0.57 # Search class: FHHNF-FSLM32-MFFFFFNN
% 1.05/0.57 # partial match(2): FGHSF-FSLM32-MFFFFFNN
% 1.05/0.57 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.05/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 163s (1) cores
% 1.05/0.57 # Preprocessing time : 0.014 s
% 1.05/0.57 # Presaturation interreduction done
% 1.05/0.57
% 1.05/0.57 # Proof found!
% 1.05/0.57 # SZS status Theorem
% 1.05/0.57 # SZS output start CNFRefutation
% See solution above
% 1.05/0.57 # Parsed axioms : 10189
% 1.05/0.57 # Removed by relevancy pruning/SinE : 10112
% 1.05/0.57 # Initial clauses : 293
% 1.05/0.57 # Removed in clause preprocessing : 0
% 1.05/0.57 # Initial clauses in saturation : 293
% 1.05/0.57 # Processed clauses : 723
% 1.05/0.57 # ...of these trivial : 1
% 1.05/0.57 # ...subsumed : 32
% 1.05/0.57 # ...remaining for further processing : 690
% 1.05/0.57 # Other redundant clauses eliminated : 0
% 1.05/0.57 # Clauses deleted for lack of memory : 0
% 1.05/0.57 # Backward-subsumed : 0
% 1.05/0.57 # Backward-rewritten : 0
% 1.05/0.57 # Generated clauses : 222
% 1.05/0.57 # ...of the previous two non-redundant : 214
% 1.05/0.57 # ...aggressively subsumed : 0
% 1.05/0.57 # Contextual simplify-reflections : 2
% 1.05/0.57 # Paramodulations : 222
% 1.05/0.57 # Factorizations : 0
% 1.05/0.57 # NegExts : 0
% 1.05/0.57 # Equation resolutions : 0
% 1.05/0.57 # Disequality decompositions : 0
% 1.05/0.57 # Total rewrite steps : 4
% 1.05/0.57 # ...of those cached : 0
% 1.05/0.57 # Propositional unsat checks : 0
% 1.05/0.57 # Propositional check models : 0
% 1.05/0.57 # Propositional check unsatisfiable : 0
% 1.05/0.57 # Propositional clauses : 0
% 1.05/0.57 # Propositional clauses after purity: 0
% 1.05/0.57 # Propositional unsat core size : 0
% 1.05/0.57 # Propositional preprocessing time : 0.000
% 1.05/0.57 # Propositional encoding time : 0.000
% 1.05/0.57 # Propositional solver time : 0.000
% 1.05/0.57 # Success case prop preproc time : 0.000
% 1.05/0.57 # Success case prop encoding time : 0.000
% 1.05/0.57 # Success case prop solver time : 0.000
% 1.05/0.57 # Current number of processed clauses : 397
% 1.05/0.57 # Positive orientable unit clauses : 242
% 1.05/0.57 # Positive unorientable unit clauses: 0
% 1.05/0.57 # Negative unit clauses : 0
% 1.05/0.57 # Non-unit-clauses : 155
% 1.05/0.57 # Current number of unprocessed clauses: 76
% 1.05/0.57 # ...number of literals in the above : 375
% 1.05/0.57 # Current number of archived formulas : 0
% 1.05/0.57 # Current number of archived clauses : 293
% 1.05/0.57 # Clause-clause subsumption calls (NU) : 10632
% 1.05/0.57 # Rec. Clause-clause subsumption calls : 5444
% 1.05/0.57 # Non-unit clause-clause subsumptions : 34
% 1.05/0.57 # Unit Clause-clause subsumption calls : 201
% 1.05/0.57 # Rewrite failures with RHS unbound : 0
% 1.05/0.57 # BW rewrite match attempts : 0
% 1.05/0.57 # BW rewrite match successes : 0
% 1.05/0.57 # Condensation attempts : 0
% 1.05/0.57 # Condensation successes : 0
% 1.05/0.57 # Termbank termtop insertions : 57605
% 1.05/0.57 # Search garbage collected termcells : 39351
% 1.05/0.57
% 1.05/0.57 # -------------------------------------------------
% 1.05/0.57 # User time : 0.071 s
% 1.05/0.57 # System time : 0.063 s
% 1.05/0.57 # Total time : 0.134 s
% 1.05/0.57 # Maximum resident set size: 42600 pages
% 1.05/0.57
% 1.05/0.57 # -------------------------------------------------
% 1.05/0.57 # User time : 0.110 s
% 1.05/0.57 # System time : 0.073 s
% 1.05/0.57 # Total time : 0.183 s
% 1.05/0.57 # Maximum resident set size: 10656 pages
% 1.05/0.57 % E---3.1 exiting
% 1.05/0.57 % E exiting
%------------------------------------------------------------------------------