TSTP Solution File: CSR114+27 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR114+27 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:54 EDT 2024
% Result : Theorem 3.25s 2.89s
% Output : CNFRefutation 3.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 11 unt; 0 def)
% Number of atoms : 186 ( 0 equ)
% Maximal formula atoms : 105 ( 7 avg)
% Number of connectives : 205 ( 44 ~; 36 |; 124 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 105 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-2 aty)
% Number of functors : 33 ( 33 usr; 32 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn 9 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_004_qapw_90,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.dbKKEsjWGT/E---3.1_1397.p',synth_qa07_004_qapw_90) ).
fof(ave07_era5_synth_qa07_004_qapw_90,hypothesis,
( obj(c16,c21)
& subs(c16,aufnehmen_1_1)
& loc(c21,c35)
& sub(c21,konzert__1_1)
& loc(c25,c34)
& sub(c25,kolosseum_1_1)
& attr(c31,c32)
& sub(c31,stadt__1_1)
& sub(c32,name_1_1)
& val(c32,rom_0)
& in(c34,c31)
& in(c35,c25)
& sort(c16,dn)
& fact(c16,real)
& gener(c16,sp)
& sort(c21,ad)
& sort(c21,d)
& sort(c21,io)
& card(c21,int1)
& etype(c21,int0)
& fact(c21,real)
& gener(c21,sp)
& quant(c21,one)
& refer(c21,det)
& varia(c21,con)
& sort(aufnehmen_1_1,dn)
& fact(aufnehmen_1_1,real)
& gener(aufnehmen_1_1,ge)
& sort(c35,l)
& card(c35,int1)
& etype(c35,int0)
& fact(c35,real)
& gener(c35,sp)
& quant(c35,one)
& refer(c35,det)
& varia(c35,con)
& sort(konzert__1_1,ad)
& sort(konzert__1_1,d)
& sort(konzert__1_1,io)
& card(konzert__1_1,int1)
& etype(konzert__1_1,int0)
& fact(konzert__1_1,real)
& gener(konzert__1_1,ge)
& quant(konzert__1_1,one)
& refer(konzert__1_1,refer_c)
& varia(konzert__1_1,varia_c)
& sort(c25,d)
& card(c25,int1)
& etype(c25,int0)
& fact(c25,real)
& gener(c25,sp)
& quant(c25,one)
& refer(c25,det)
& varia(c25,con)
& sort(c34,l)
& card(c34,int1)
& etype(c34,int0)
& fact(c34,real)
& gener(c34,sp)
& quant(c34,one)
& refer(c34,det)
& varia(c34,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(c31,d)
& sort(c31,io)
& card(c31,int1)
& etype(c31,int0)
& fact(c31,real)
& gener(c31,sp)
& quant(c31,one)
& refer(c31,det)
& varia(c31,con)
& sort(c32,na)
& card(c32,int1)
& etype(c32,int0)
& fact(c32,real)
& gener(c32,sp)
& quant(c32,one)
& refer(c32,indet)
& varia(c32,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) ),
file('/export/starexec/sandbox2/tmp/tmp.dbKKEsjWGT/E---3.1_1397.p',ave07_era5_synth_qa07_004_qapw_90) ).
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.dbKKEsjWGT/E---3.1_1397.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_qapw_90]) ).
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(c32,rom_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapw_90]) ).
cnf(c_0_7,hypothesis,
sub(c32,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapw_90]) ).
cnf(c_0_8,hypothesis,
( ~ in(X1,X2)
| ~ attr(X2,c32)
| ~ 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(c31,c32),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapw_90]) ).
cnf(c_0_10,hypothesis,
sub(c31,stadt__1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapw_90]) ).
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,c31)
| ~ 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(c34,c31),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapw_90]) ).
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(c25,c34),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapw_90]) ).
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,c34)
| ~ 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(c25,c34),c34),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,hypothesis,
subs(esk3_2(c25,c34),stehen_1_1),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_20,hypothesis,
( ~ scar(esk3_2(c25,c34),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(c25,kolosseum_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapw_90]) ).
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(c25,c34),c25),
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.16/1.18 % Problem : CSR114+27 : TPTP v8.1.2. Released v4.0.0.
% 1.16/1.19 % Command : run_E %s %d THM
% 1.19/1.39 % Computer : n019.cluster.edu
% 1.19/1.39 % Model : x86_64 x86_64
% 1.19/1.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.19/1.39 % Memory : 8042.1875MB
% 1.19/1.39 % OS : Linux 3.10.0-693.el7.x86_64
% 1.19/1.39 % CPULimit : 300
% 1.19/1.39 % WCLimit : 300
% 1.19/1.39 % DateTime : Fri May 3 15:19:54 EDT 2024
% 1.19/1.40 % CPUTime :
% 2.42/2.64 Running first-order theorem proving
% 2.42/2.64 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.dbKKEsjWGT/E---3.1_1397.p
% 3.25/2.89 # Version: 3.1.0
% 3.25/2.89 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.25/2.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.25/2.89 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.25/2.89 # Starting new_bool_3 with 300s (1) cores
% 3.25/2.89 # Starting new_bool_1 with 300s (1) cores
% 3.25/2.89 # Starting sh5l with 300s (1) cores
% 3.25/2.89 # new_bool_3 with pid 1477 completed with status 0
% 3.25/2.89 # Result found by new_bool_3
% 3.25/2.89 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.25/2.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.25/2.89 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.25/2.89 # Starting new_bool_3 with 300s (1) cores
% 3.25/2.89 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.25/2.89 # Search class: FHHNF-FFMM32-SFFFFFNN
% 3.25/2.89 # partial match(1): FGHNF-FFMM32-SFFFFFNN
% 3.25/2.89 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.25/2.89 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 181s (1) cores
% 3.25/2.89 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 1480 completed with status 0
% 3.25/2.89 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 3.25/2.89 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.25/2.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.25/2.89 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.25/2.89 # Starting new_bool_3 with 300s (1) cores
% 3.25/2.89 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.25/2.89 # Search class: FHHNF-FFMM32-SFFFFFNN
% 3.25/2.89 # partial match(1): FGHNF-FFMM32-SFFFFFNN
% 3.25/2.89 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.25/2.89 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 181s (1) cores
% 3.25/2.89 # Preprocessing time : 0.013 s
% 3.25/2.89 # Presaturation interreduction done
% 3.25/2.89
% 3.25/2.89 # Proof found!
% 3.25/2.89 # SZS status Theorem
% 3.25/2.89 # SZS output start CNFRefutation
% See solution above
% 3.25/2.89 # Parsed axioms : 10189
% 3.25/2.89 # Removed by relevancy pruning/SinE : 10135
% 3.25/2.89 # Initial clauses : 174
% 3.25/2.89 # Removed in clause preprocessing : 0
% 3.25/2.89 # Initial clauses in saturation : 174
% 3.25/2.89 # Processed clauses : 487
% 3.25/2.89 # ...of these trivial : 0
% 3.25/2.89 # ...subsumed : 0
% 3.25/2.89 # ...remaining for further processing : 486
% 3.25/2.89 # Other redundant clauses eliminated : 0
% 3.25/2.89 # Clauses deleted for lack of memory : 0
% 3.25/2.89 # Backward-subsumed : 0
% 3.25/2.89 # Backward-rewritten : 0
% 3.25/2.89 # Generated clauses : 165
% 3.25/2.89 # ...of the previous two non-redundant : 165
% 3.25/2.89 # ...aggressively subsumed : 0
% 3.25/2.89 # Contextual simplify-reflections : 0
% 3.25/2.89 # Paramodulations : 165
% 3.25/2.89 # Factorizations : 0
% 3.25/2.89 # NegExts : 0
% 3.25/2.89 # Equation resolutions : 0
% 3.25/2.89 # Disequality decompositions : 0
% 3.25/2.89 # Total rewrite steps : 3
% 3.25/2.89 # ...of those cached : 0
% 3.25/2.89 # Propositional unsat checks : 0
% 3.25/2.89 # Propositional check models : 0
% 3.25/2.89 # Propositional check unsatisfiable : 0
% 3.25/2.89 # Propositional clauses : 0
% 3.25/2.89 # Propositional clauses after purity: 0
% 3.25/2.89 # Propositional unsat core size : 0
% 3.25/2.89 # Propositional preprocessing time : 0.000
% 3.25/2.89 # Propositional encoding time : 0.000
% 3.25/2.89 # Propositional solver time : 0.000
% 3.25/2.89 # Success case prop preproc time : 0.000
% 3.25/2.89 # Success case prop encoding time : 0.000
% 3.25/2.89 # Success case prop solver time : 0.000
% 3.25/2.89 # Current number of processed clauses : 312
% 3.25/2.89 # Positive orientable unit clauses : 241
% 3.25/2.89 # Positive unorientable unit clauses: 0
% 3.25/2.89 # Negative unit clauses : 1
% 3.25/2.89 # Non-unit-clauses : 70
% 3.25/2.89 # Current number of unprocessed clauses: 26
% 3.25/2.89 # ...number of literals in the above : 82
% 3.25/2.89 # Current number of archived formulas : 0
% 3.25/2.89 # Current number of archived clauses : 174
% 3.25/2.89 # Clause-clause subsumption calls (NU) : 1656
% 3.25/2.89 # Rec. Clause-clause subsumption calls : 636
% 3.25/2.89 # Non-unit clause-clause subsumptions : 0
% 3.25/2.89 # Unit Clause-clause subsumption calls : 938
% 3.25/2.89 # Rewrite failures with RHS unbound : 0
% 3.25/2.89 # BW rewrite match attempts : 0
% 3.25/2.89 # BW rewrite match successes : 0
% 3.25/2.89 # Condensation attempts : 0
% 3.25/2.89 # Condensation successes : 0
% 3.25/2.89 # Termbank termtop insertions : 50906
% 3.25/2.89 # Search garbage collected termcells : 39006
% 3.25/2.89
% 3.25/2.89 # -------------------------------------------------
% 3.25/2.89 # User time : 0.058 s
% 3.25/2.89 # System time : 0.052 s
% 3.25/2.89 # Total time : 0.111 s
% 3.25/2.89 # Maximum resident set size: 42520 pages
% 3.25/2.89
% 3.25/2.89 # -------------------------------------------------
% 3.25/2.89 # User time : 0.139 s
% 3.25/2.89 # System time : 0.070 s
% 3.25/2.89 # Total time : 0.209 s
% 3.25/2.89 # Maximum resident set size: 10776 pages
% 3.25/2.89 % E---3.1 exiting
% 3.25/2.90 % E exiting
%------------------------------------------------------------------------------