TSTP Solution File: CSR115+52 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR115+52 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:34:05 EDT 2024
% Result : Theorem 2.77s 2.90s
% Output : CNFRefutation 2.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 7 unt; 0 def)
% Number of atoms : 206 ( 0 equ)
% Maximal formula atoms : 147 ( 13 avg)
% Number of connectives : 226 ( 35 ~; 29 |; 162 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 147 ( 16 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-2 aty)
% Number of functors : 40 ( 40 usr; 40 con; 0-0 aty)
% Number of variables : 37 ( 7 sgn 7 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_007_mira_news_1305,conjecture,
? [X1,X2,X3,X4,X5,X6,X7] :
( agt(X5,X4)
& attr(X1,X2)
& attr(X4,X3)
& attr(X6,X7)
& sub(X2,name_1_1)
& sub(X3,name_1_1)
& subs(X5,n374bernehmen_1_1)
& val(X2,bmw_0)
& val(X3,bmw_0) ),
file('/export/starexec/sandbox2/tmp/tmp.seamZdtIKL/E---3.1_2756.p',synth_qa07_007_mira_news_1305) ).
fof(ave07_era5_synth_qa07_007_mira_news_1305,hypothesis,
( assoc(autokonzern_1_1,auto__1_1)
& sub(autokonzern_1_1,firmengruppe_1_1)
& assoc(autounternehmen_1_1,auto__1_1)
& sub(autounternehmen_1_1,unternehmen_1_1)
& attr(c0,c1)
& sub(c0,stadt__1_1)
& sub(c1,name_1_1)
& val(c1,m__374nchen_0)
& agt(c163,c165)
& obj(c163,c218)
& subs(c163,n374bernehmen_1_1)
& attr(c165,c166)
& prop(c165,m__374nchner_1_1)
& sub(c165,autokonzern_1_1)
& sub(c166,name_1_1)
& val(c166,bmw_0)
& attr(c218,c219)
& prop(c218,altbew__344hrt_1_1)
& prop(c218,britisch__1_1)
& sub(c218,autounternehmen_1_1)
& sub(c219,name_1_1)
& val(c219,rover_0)
& assoc(m__374nchner_1_1,c0)
& sort(autokonzern_1_1,d)
& sort(autokonzern_1_1,io)
& card(autokonzern_1_1,int1)
& etype(autokonzern_1_1,int0)
& fact(autokonzern_1_1,real)
& gener(autokonzern_1_1,ge)
& quant(autokonzern_1_1,one)
& refer(autokonzern_1_1,refer_c)
& varia(autokonzern_1_1,varia_c)
& sort(auto__1_1,d)
& card(auto__1_1,int1)
& etype(auto__1_1,int0)
& fact(auto__1_1,real)
& gener(auto__1_1,ge)
& quant(auto__1_1,one)
& refer(auto__1_1,refer_c)
& varia(auto__1_1,varia_c)
& sort(firmengruppe_1_1,d)
& sort(firmengruppe_1_1,io)
& card(firmengruppe_1_1,int1)
& etype(firmengruppe_1_1,int0)
& fact(firmengruppe_1_1,real)
& gener(firmengruppe_1_1,ge)
& quant(firmengruppe_1_1,one)
& refer(firmengruppe_1_1,refer_c)
& varia(firmengruppe_1_1,varia_c)
& sort(autounternehmen_1_1,d)
& sort(autounternehmen_1_1,io)
& card(autounternehmen_1_1,int1)
& etype(autounternehmen_1_1,int0)
& fact(autounternehmen_1_1,real)
& gener(autounternehmen_1_1,ge)
& quant(autounternehmen_1_1,one)
& refer(autounternehmen_1_1,refer_c)
& varia(autounternehmen_1_1,varia_c)
& sort(unternehmen_1_1,d)
& sort(unternehmen_1_1,io)
& card(unternehmen_1_1,int1)
& etype(unternehmen_1_1,int0)
& fact(unternehmen_1_1,real)
& gener(unternehmen_1_1,ge)
& quant(unternehmen_1_1,one)
& refer(unternehmen_1_1,refer_c)
& varia(unternehmen_1_1,varia_c)
& sort(c0,d)
& sort(c0,io)
& card(c0,int1)
& etype(c0,int0)
& fact(c0,real)
& gener(c0,sp)
& quant(c0,one)
& refer(c0,det)
& varia(c0,varia_c)
& sort(c1,na)
& card(c1,int1)
& etype(c1,int0)
& fact(c1,real)
& gener(c1,sp)
& quant(c1,one)
& refer(c1,det)
& varia(c1,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(m__374nchen_0,fe)
& sort(c163,da)
& fact(c163,real)
& gener(c163,sp)
& sort(c165,d)
& sort(c165,io)
& card(c165,int1)
& etype(c165,int0)
& fact(c165,real)
& gener(c165,sp)
& quant(c165,one)
& refer(c165,det)
& varia(c165,con)
& sort(c218,d)
& sort(c218,io)
& card(c218,int1)
& etype(c218,int0)
& fact(c218,real)
& gener(c218,sp)
& quant(c218,one)
& refer(c218,det)
& varia(c218,con)
& sort(n374bernehmen_1_1,da)
& fact(n374bernehmen_1_1,real)
& gener(n374bernehmen_1_1,ge)
& sort(c166,na)
& card(c166,int1)
& etype(c166,int0)
& fact(c166,real)
& gener(c166,sp)
& quant(c166,one)
& refer(c166,indet)
& varia(c166,varia_c)
& sort(m__374nchner_1_1,gq)
& sort(bmw_0,fe)
& sort(c219,na)
& card(c219,int1)
& etype(c219,int0)
& fact(c219,real)
& gener(c219,sp)
& quant(c219,one)
& refer(c219,indet)
& varia(c219,varia_c)
& sort(altbew__344hrt_1_1,ql)
& sort(britisch__1_1,nq)
& sort(rover_0,fe) ),
file('/export/starexec/sandbox2/tmp/tmp.seamZdtIKL/E---3.1_2756.p',ave07_era5_synth_qa07_007_mira_news_1305) ).
fof(c_0_2,negated_conjecture,
~ ? [X1,X2,X3,X4,X5,X6,X7] :
( agt(X5,X4)
& attr(X1,X2)
& attr(X4,X3)
& attr(X6,X7)
& sub(X2,name_1_1)
& sub(X3,name_1_1)
& subs(X5,n374bernehmen_1_1)
& val(X2,bmw_0)
& val(X3,bmw_0) ),
inference(assume_negation,[status(cth)],[synth_qa07_007_mira_news_1305]) ).
fof(c_0_3,negated_conjecture,
! [X8,X9,X10,X11,X12,X13,X14] :
( ~ agt(X12,X11)
| ~ attr(X8,X9)
| ~ attr(X11,X10)
| ~ attr(X13,X14)
| ~ sub(X9,name_1_1)
| ~ sub(X10,name_1_1)
| ~ subs(X12,n374bernehmen_1_1)
| ~ val(X9,bmw_0)
| ~ val(X10,bmw_0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
cnf(c_0_4,negated_conjecture,
( ~ agt(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X2,X5)
| ~ attr(X6,X7)
| ~ sub(X4,name_1_1)
| ~ sub(X5,name_1_1)
| ~ subs(X1,n374bernehmen_1_1)
| ~ val(X4,bmw_0)
| ~ val(X5,bmw_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,hypothesis,
agt(c163,c165),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1305]) ).
cnf(c_0_6,hypothesis,
subs(c163,n374bernehmen_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1305]) ).
cnf(c_0_7,hypothesis,
( ~ val(X1,bmw_0)
| ~ val(X2,bmw_0)
| ~ attr(c165,X1)
| ~ attr(X3,X4)
| ~ attr(X5,X2)
| ~ sub(X1,name_1_1)
| ~ sub(X2,name_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6])]) ).
cnf(c_0_8,hypothesis,
attr(c218,c219),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1305]) ).
cnf(c_0_9,hypothesis,
( ~ val(X1,bmw_0)
| ~ val(X2,bmw_0)
| ~ attr(c165,X1)
| ~ attr(X3,X2)
| ~ sub(X1,name_1_1)
| ~ sub(X2,name_1_1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,hypothesis,
attr(c165,c166),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1305]) ).
cnf(c_0_11,hypothesis,
val(c166,bmw_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1305]) ).
cnf(c_0_12,hypothesis,
sub(c166,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1305]) ).
cnf(c_0_13,hypothesis,
( ~ val(X1,bmw_0)
| ~ attr(c165,X1)
| ~ sub(X1,name_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_14,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_10]),c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 1.20/1.29 % Problem : CSR115+52 : TPTP v8.1.2. Released v4.0.0.
% 1.20/1.30 % Command : run_E %s %d THM
% 1.28/1.49 % Computer : n005.cluster.edu
% 1.28/1.49 % Model : x86_64 x86_64
% 1.28/1.49 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.28/1.49 % Memory : 8042.1875MB
% 1.28/1.49 % OS : Linux 3.10.0-693.el7.x86_64
% 1.28/1.49 % CPULimit : 300
% 1.28/1.49 % WCLimit : 300
% 1.28/1.49 % DateTime : Fri May 3 15:17:09 EDT 2024
% 1.28/1.49 % CPUTime :
% 2.41/2.68 Running first-order theorem proving
% 2.41/2.68 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.seamZdtIKL/E---3.1_2756.p
% 2.77/2.90 # Version: 3.1.0
% 2.77/2.90 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.77/2.90 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.77/2.90 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.77/2.90 # Starting new_bool_3 with 300s (1) cores
% 2.77/2.90 # Starting new_bool_1 with 300s (1) cores
% 2.77/2.90 # Starting sh5l with 300s (1) cores
% 2.77/2.90 # new_bool_1 with pid 2837 completed with status 0
% 2.77/2.90 # Result found by new_bool_1
% 2.77/2.90 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.77/2.90 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.77/2.90 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.77/2.90 # Starting new_bool_3 with 300s (1) cores
% 2.77/2.90 # Starting new_bool_1 with 300s (1) cores
% 2.77/2.90 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.77/2.90 # Search class: FHHNF-FFMM33-SFFFFFNN
% 2.77/2.90 # partial match(1): FGHNF-FFMM33-SFFFFFNN
% 2.77/2.90 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.77/2.90 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 2.77/2.90 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 2839 completed with status 0
% 2.77/2.90 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 2.77/2.90 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.77/2.90 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.77/2.90 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.77/2.90 # Starting new_bool_3 with 300s (1) cores
% 2.77/2.90 # Starting new_bool_1 with 300s (1) cores
% 2.77/2.90 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.77/2.90 # Search class: FHHNF-FFMM33-SFFFFFNN
% 2.77/2.90 # partial match(1): FGHNF-FFMM33-SFFFFFNN
% 2.77/2.90 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.77/2.90 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 2.77/2.90 # Preprocessing time : 0.010 s
% 2.77/2.90 # Presaturation interreduction done
% 2.77/2.90
% 2.77/2.90 # Proof found!
% 2.77/2.90 # SZS status Theorem
% 2.77/2.90 # SZS output start CNFRefutation
% See solution above
% 2.77/2.90 # Parsed axioms : 10189
% 2.77/2.90 # Removed by relevancy pruning/SinE : 10130
% 2.77/2.90 # Initial clauses : 225
% 2.77/2.90 # Removed in clause preprocessing : 0
% 2.77/2.90 # Initial clauses in saturation : 225
% 2.77/2.90 # Processed clauses : 494
% 2.77/2.90 # ...of these trivial : 0
% 2.77/2.90 # ...subsumed : 0
% 2.77/2.90 # ...remaining for further processing : 494
% 2.77/2.90 # Other redundant clauses eliminated : 0
% 2.77/2.90 # Clauses deleted for lack of memory : 0
% 2.77/2.90 # Backward-subsumed : 2
% 2.77/2.90 # Backward-rewritten : 0
% 2.77/2.90 # Generated clauses : 203
% 2.77/2.90 # ...of the previous two non-redundant : 202
% 2.77/2.90 # ...aggressively subsumed : 0
% 2.77/2.90 # Contextual simplify-reflections : 0
% 2.77/2.90 # Paramodulations : 203
% 2.77/2.90 # Factorizations : 0
% 2.77/2.90 # NegExts : 0
% 2.77/2.90 # Equation resolutions : 0
% 2.77/2.90 # Disequality decompositions : 0
% 2.77/2.90 # Total rewrite steps : 10
% 2.77/2.90 # ...of those cached : 5
% 2.77/2.90 # Propositional unsat checks : 0
% 2.77/2.90 # Propositional check models : 0
% 2.77/2.90 # Propositional check unsatisfiable : 0
% 2.77/2.90 # Propositional clauses : 0
% 2.77/2.90 # Propositional clauses after purity: 0
% 2.77/2.90 # Propositional unsat core size : 0
% 2.77/2.90 # Propositional preprocessing time : 0.000
% 2.77/2.90 # Propositional encoding time : 0.000
% 2.77/2.90 # Propositional solver time : 0.000
% 2.77/2.90 # Success case prop preproc time : 0.000
% 2.77/2.90 # Success case prop encoding time : 0.000
% 2.77/2.90 # Success case prop solver time : 0.000
% 2.77/2.90 # Current number of processed clauses : 267
% 2.77/2.90 # Positive orientable unit clauses : 203
% 2.77/2.90 # Positive unorientable unit clauses: 0
% 2.77/2.90 # Negative unit clauses : 0
% 2.77/2.90 # Non-unit-clauses : 64
% 2.77/2.90 # Current number of unprocessed clauses: 158
% 2.77/2.90 # ...number of literals in the above : 292
% 2.77/2.90 # Current number of archived formulas : 0
% 2.77/2.90 # Current number of archived clauses : 227
% 2.77/2.90 # Clause-clause subsumption calls (NU) : 1931
% 2.77/2.90 # Rec. Clause-clause subsumption calls : 710
% 2.77/2.90 # Non-unit clause-clause subsumptions : 2
% 2.77/2.90 # Unit Clause-clause subsumption calls : 61
% 2.77/2.90 # Rewrite failures with RHS unbound : 0
% 2.77/2.90 # BW rewrite match attempts : 0
% 2.77/2.90 # BW rewrite match successes : 0
% 2.77/2.90 # Condensation attempts : 0
% 2.77/2.90 # Condensation successes : 0
% 2.77/2.90 # Termbank termtop insertions : 52675
% 2.77/2.90 # Search garbage collected termcells : 39072
% 2.77/2.90
% 2.77/2.90 # -------------------------------------------------
% 2.77/2.90 # User time : 0.063 s
% 2.77/2.90 # System time : 0.046 s
% 2.77/2.90 # Total time : 0.109 s
% 2.77/2.90 # Maximum resident set size: 42604 pages
% 2.77/2.90
% 2.77/2.90 # -------------------------------------------------
% 2.77/2.90 # User time : 0.116 s
% 2.77/2.90 # System time : 0.057 s
% 2.77/2.90 # Total time : 0.173 s
% 2.77/2.90 # Maximum resident set size: 10792 pages
% 2.77/2.90 % E---3.1 exiting
% 2.77/2.90 % E exiting
%------------------------------------------------------------------------------