TSTP Solution File: CSR114+5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR114+5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 : Sat May 4 07:33:55 EDT 2024
% Result : Theorem 2.34s 2.75s
% Output : CNFRefutation 2.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 11 unt; 0 def)
% Number of atoms : 274 ( 0 equ)
% Maximal formula atoms : 193 ( 10 avg)
% Number of connectives : 293 ( 44 ~; 36 |; 212 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 193 ( 12 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 21 ( 20 usr; 1 prp; 0-2 aty)
% Number of functors : 57 ( 57 usr; 56 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn 9 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_004_insicht_5,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/sandbox2/tmp/tmp.7inDhoeVpv/E---3.1_22932.p',synth_qa07_004_insicht_5) ).
fof(ave07_era5_synth_qa07_004_insicht_5,hypothesis,
( sub(c12,m__344rtyrer_1_1)
& attr(c21,c26)
& prop(c21,heilig_1_1)
& sub(c26,jahr__1_1)
& val(c26,c22)
& loc(c30,c80)
& prop(c30,n366kumenisch_1_1)
& subs(c30,zeremonie_1_1)
& attch(c34,c44)
& loc(c34,c79)
& sub(c34,kolosseum_1_1)
& attr(c42,c43)
& sub(c42,stadt__1_1)
& sub(c43,name_1_1)
& val(c43,rom_0)
& sub(c44,vorsitz_1_1)
& attch(c47,c44)
& sub(c47,kirchenf__374rst_1_1)
& ctxt(c57,c30)
& mcont(c57,c12)
& subs(c57,denken_2_2)
& temp(c57,c21)
& in(c79,c42)
& in(c80,c34)
& sort(c12,d)
& card(c12,int1)
& etype(c12,int0)
& fact(c12,hypo)
& gener(c12,sp)
& quant(c12,one)
& refer(c12,det)
& varia(c12,con)
& sort(m__344rtyrer_1_1,d)
& card(m__344rtyrer_1_1,int1)
& etype(m__344rtyrer_1_1,int0)
& fact(m__344rtyrer_1_1,real)
& gener(m__344rtyrer_1_1,ge)
& quant(m__344rtyrer_1_1,one)
& refer(m__344rtyrer_1_1,refer_c)
& varia(m__344rtyrer_1_1,varia_c)
& sort(c21,t)
& card(c21,int1)
& etype(c21,int0)
& fact(c21,real)
& gener(c21,sp)
& quant(c21,one)
& refer(c21,det)
& varia(c21,con)
& sort(c26,me)
& sort(c26,oa)
& sort(c26,ta)
& card(c26,card_c)
& etype(c26,etype_c)
& fact(c26,real)
& gener(c26,sp)
& quant(c26,quant_c)
& refer(c26,refer_c)
& varia(c26,varia_c)
& sort(heilig_1_1,nq)
& sort(jahr__1_1,me)
& sort(jahr__1_1,oa)
& sort(jahr__1_1,ta)
& card(jahr__1_1,card_c)
& etype(jahr__1_1,etype_c)
& fact(jahr__1_1,real)
& gener(jahr__1_1,ge)
& quant(jahr__1_1,quant_c)
& refer(jahr__1_1,refer_c)
& varia(jahr__1_1,varia_c)
& sort(c22,nu)
& card(c22,int2000)
& sort(c30,ad)
& card(c30,int1)
& etype(c30,int0)
& fact(c30,real)
& gener(c30,sp)
& quant(c30,one)
& refer(c30,indet)
& varia(c30,varia_c)
& sort(c80,l)
& card(c80,int1)
& etype(c80,int0)
& fact(c80,real)
& gener(c80,sp)
& quant(c80,one)
& refer(c80,det)
& varia(c80,con)
& sort(n366kumenisch_1_1,tq)
& sort(zeremonie_1_1,ad)
& card(zeremonie_1_1,int1)
& etype(zeremonie_1_1,int0)
& fact(zeremonie_1_1,real)
& gener(zeremonie_1_1,ge)
& quant(zeremonie_1_1,one)
& refer(zeremonie_1_1,refer_c)
& varia(zeremonie_1_1,varia_c)
& sort(c34,d)
& card(c34,int1)
& etype(c34,int0)
& fact(c34,real)
& gener(c34,sp)
& quant(c34,one)
& refer(c34,det)
& varia(c34,con)
& sort(c44,io)
& card(c44,int1)
& etype(c44,int0)
& fact(c44,real)
& gener(c44,sp)
& quant(c44,one)
& refer(c44,det)
& varia(c44,varia_c)
& sort(c79,l)
& card(c79,int1)
& etype(c79,int0)
& fact(c79,real)
& gener(c79,sp)
& quant(c79,one)
& refer(c79,det)
& varia(c79,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(c42,d)
& sort(c42,io)
& card(c42,int1)
& etype(c42,int0)
& fact(c42,real)
& gener(c42,sp)
& quant(c42,one)
& refer(c42,det)
& varia(c42,con)
& sort(c43,na)
& card(c43,int1)
& etype(c43,int0)
& fact(c43,real)
& gener(c43,sp)
& quant(c43,one)
& refer(c43,indet)
& varia(c43,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(rom_0,fe)
& sort(vorsitz_1_1,io)
& card(vorsitz_1_1,int1)
& etype(vorsitz_1_1,int0)
& fact(vorsitz_1_1,real)
& gener(vorsitz_1_1,ge)
& quant(vorsitz_1_1,one)
& refer(vorsitz_1_1,refer_c)
& varia(vorsitz_1_1,varia_c)
& sort(c47,d)
& card(c47,int1)
& etype(c47,int0)
& fact(c47,real)
& gener(c47,sp)
& quant(c47,one)
& refer(c47,det)
& varia(c47,con)
& sort(kirchenf__374rst_1_1,d)
& card(kirchenf__374rst_1_1,int1)
& etype(kirchenf__374rst_1_1,int0)
& fact(kirchenf__374rst_1_1,real)
& gener(kirchenf__374rst_1_1,ge)
& quant(kirchenf__374rst_1_1,one)
& refer(kirchenf__374rst_1_1,refer_c)
& varia(kirchenf__374rst_1_1,varia_c)
& sort(c57,st)
& fact(c57,real)
& gener(c57,sp)
& sort(denken_2_2,st)
& fact(denken_2_2,real)
& gener(denken_2_2,ge) ),
file('/export/starexec/sandbox2/tmp/tmp.7inDhoeVpv/E---3.1_22932.p',ave07_era5_synth_qa07_004_insicht_5) ).
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/sandbox2/tmp/tmp.7inDhoeVpv/E---3.1_22932.p',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_5]) ).
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(c43,rom_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_insicht_5]) ).
cnf(c_0_7,hypothesis,
sub(c43,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_insicht_5]) ).
cnf(c_0_8,hypothesis,
( ~ in(X1,X2)
| ~ attr(X2,c43)
| ~ 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(c42,c43),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_insicht_5]) ).
cnf(c_0_10,hypothesis,
sub(c42,stadt__1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_insicht_5]) ).
fof(c_0_11,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_12,hypothesis,
( ~ in(X1,c42)
| ~ 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_13,hypothesis,
in(c79,c42),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_insicht_5]) ).
cnf(c_0_14,plain,
( loc(esk3_2(X1,X2),X2)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,hypothesis,
loc(c34,c79),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_insicht_5]) ).
cnf(c_0_16,plain,
( subs(esk3_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,hypothesis,
( ~ scar(X1,X2)
| ~ loc(X1,c79)
| ~ subs(X1,stehen_1_1)
| ~ sub(X2,kolosseum_1_1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,hypothesis,
loc(esk3_2(c34,c79),c79),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,hypothesis,
subs(esk3_2(c34,c79),stehen_1_1),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_20,hypothesis,
( ~ scar(esk3_2(c34,c79),X1)
| ~ sub(X1,kolosseum_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_21,hypothesis,
sub(c34,kolosseum_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_insicht_5]) ).
cnf(c_0_22,plain,
( scar(esk3_2(X1,X2),X1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,hypothesis,
~ scar(esk3_2(c34,c79),c34),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_15]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 1.12/1.15 % Problem : CSR114+5 : TPTP v8.1.2. Released v4.0.0.
% 1.12/1.16 % Command : run_E %s %d THM
% 1.16/1.37 % Computer : n027.cluster.edu
% 1.16/1.37 % Model : x86_64 x86_64
% 1.16/1.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.16/1.37 % Memory : 8042.1875MB
% 1.16/1.37 % OS : Linux 3.10.0-693.el7.x86_64
% 1.16/1.37 % CPULimit : 300
% 1.16/1.37 % WCLimit : 300
% 1.16/1.37 % DateTime : Fri May 3 15:09:24 EDT 2024
% 1.16/1.37 % CPUTime :
% 2.32/2.49 Running first-order theorem proving
% 2.32/2.49 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/tmp/tmp.7inDhoeVpv/E---3.1_22932.p
% 2.34/2.75 # Version: 3.1.0
% 2.34/2.75 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.34/2.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.34/2.75 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.34/2.75 # Starting new_bool_3 with 300s (1) cores
% 2.34/2.75 # Starting new_bool_1 with 300s (1) cores
% 2.34/2.75 # Starting sh5l with 300s (1) cores
% 2.34/2.75 # new_bool_1 with pid 23012 completed with status 0
% 2.34/2.75 # Result found by new_bool_1
% 2.34/2.75 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.34/2.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.34/2.75 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.34/2.75 # Starting new_bool_3 with 300s (1) cores
% 2.34/2.75 # Starting new_bool_1 with 300s (1) cores
% 2.34/2.75 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.34/2.75 # Search class: FHHNF-FSMM32-SFFFFFNN
% 2.34/2.75 # partial match(2): FGHNF-FFMM32-SFFFFFNN
% 2.34/2.75 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.34/2.75 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 181s (1) cores
% 2.34/2.75 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 23015 completed with status 0
% 2.34/2.75 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 2.34/2.75 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.34/2.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.34/2.75 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.34/2.75 # Starting new_bool_3 with 300s (1) cores
% 2.34/2.75 # Starting new_bool_1 with 300s (1) cores
% 2.34/2.75 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.34/2.75 # Search class: FHHNF-FSMM32-SFFFFFNN
% 2.34/2.75 # partial match(2): FGHNF-FFMM32-SFFFFFNN
% 2.34/2.75 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.34/2.75 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 181s (1) cores
% 2.34/2.75 # Preprocessing time : 0.014 s
% 2.34/2.75 # Presaturation interreduction done
% 2.34/2.75
% 2.34/2.75 # Proof found!
% 2.34/2.75 # SZS status Theorem
% 2.34/2.75 # SZS output start CNFRefutation
% See solution above
% 2.34/2.75 # Parsed axioms : 10189
% 2.34/2.75 # Removed by relevancy pruning/SinE : 10111
% 2.34/2.75 # Initial clauses : 287
% 2.34/2.75 # Removed in clause preprocessing : 0
% 2.34/2.75 # Initial clauses in saturation : 287
% 2.34/2.75 # Processed clauses : 809
% 2.34/2.75 # ...of these trivial : 6
% 2.34/2.75 # ...subsumed : 0
% 2.34/2.75 # ...remaining for further processing : 802
% 2.34/2.75 # Other redundant clauses eliminated : 0
% 2.34/2.75 # Clauses deleted for lack of memory : 0
% 2.34/2.75 # Backward-subsumed : 0
% 2.34/2.75 # Backward-rewritten : 0
% 2.34/2.75 # Generated clauses : 283
% 2.34/2.75 # ...of the previous two non-redundant : 283
% 2.34/2.75 # ...aggressively subsumed : 0
% 2.34/2.75 # Contextual simplify-reflections : 0
% 2.34/2.75 # Paramodulations : 283
% 2.34/2.75 # Factorizations : 0
% 2.34/2.75 # NegExts : 0
% 2.34/2.75 # Equation resolutions : 0
% 2.34/2.75 # Disequality decompositions : 0
% 2.34/2.75 # Total rewrite steps : 9
% 2.34/2.75 # ...of those cached : 0
% 2.34/2.75 # Propositional unsat checks : 0
% 2.34/2.75 # Propositional check models : 0
% 2.34/2.75 # Propositional check unsatisfiable : 0
% 2.34/2.75 # Propositional clauses : 0
% 2.34/2.75 # Propositional clauses after purity: 0
% 2.34/2.75 # Propositional unsat core size : 0
% 2.34/2.75 # Propositional preprocessing time : 0.000
% 2.34/2.75 # Propositional encoding time : 0.000
% 2.34/2.75 # Propositional solver time : 0.000
% 2.34/2.75 # Success case prop preproc time : 0.000
% 2.34/2.75 # Success case prop encoding time : 0.000
% 2.34/2.75 # Success case prop solver time : 0.000
% 2.34/2.75 # Current number of processed clauses : 515
% 2.34/2.75 # Positive orientable unit clauses : 438
% 2.34/2.75 # Positive unorientable unit clauses: 0
% 2.34/2.75 # Negative unit clauses : 1
% 2.34/2.75 # Non-unit-clauses : 76
% 2.34/2.75 # Current number of unprocessed clauses: 48
% 2.34/2.75 # ...number of literals in the above : 149
% 2.34/2.75 # Current number of archived formulas : 0
% 2.34/2.75 # Current number of archived clauses : 287
% 2.34/2.75 # Clause-clause subsumption calls (NU) : 2577
% 2.34/2.75 # Rec. Clause-clause subsumption calls : 1189
% 2.34/2.75 # Non-unit clause-clause subsumptions : 0
% 2.34/2.75 # Unit Clause-clause subsumption calls : 333
% 2.34/2.75 # Rewrite failures with RHS unbound : 0
% 2.34/2.75 # BW rewrite match attempts : 0
% 2.34/2.75 # BW rewrite match successes : 0
% 2.34/2.75 # Condensation attempts : 0
% 2.34/2.75 # Condensation successes : 0
% 2.34/2.75 # Termbank termtop insertions : 54610
% 2.34/2.75 # Search garbage collected termcells : 39066
% 2.34/2.75
% 2.34/2.75 # -------------------------------------------------
% 2.34/2.75 # User time : 0.094 s
% 2.34/2.75 # System time : 0.087 s
% 2.34/2.75 # Total time : 0.182 s
% 2.34/2.75 # Maximum resident set size: 42676 pages
% 2.34/2.75
% 2.34/2.75 # -------------------------------------------------
% 2.34/2.75 # User time : 0.131 s
% 2.34/2.75 # System time : 0.098 s
% 2.34/2.75 # Total time : 0.228 s
% 2.34/2.75 # Maximum resident set size: 10816 pages
% 2.34/2.75 % E---3.1 exiting
% 2.34/2.75 % E exiting
%------------------------------------------------------------------------------