TSTP Solution File: CSR115+40 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR115+40 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:02 EDT 2024
% Result : Theorem 3.19s 2.76s
% Output : CNFRefutation 3.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 7 unt; 0 def)
% Number of atoms : 217 ( 0 equ)
% Maximal formula atoms : 156 ( 14 avg)
% Number of connectives : 239 ( 37 ~; 31 |; 171 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 156 ( 16 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 19 ( 18 usr; 1 prp; 0-2 aty)
% Number of functors : 41 ( 41 usr; 41 con; 0-0 aty)
% Number of variables : 37 ( 5 sgn 7 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_007_mira_news_1243,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(X1,firma_1_1)
& sub(X3,name_1_1)
& val(X2,bmw_0)
& val(X3,bmw_0) ),
file('/export/starexec/sandbox2/tmp/tmp.ToHknYMDyM/E---3.1_19516.p',synth_qa07_007_mira_news_1243) ).
fof(ave07_era5_synth_qa07_007_mira_news_1243,hypothesis,
( assoc(autobauer_1_1,auto__1_1)
& sub(autobauer_1_1,fabrikant_1_1)
& attr(c788,c789)
& sub(c788,firma_1_1)
& sub(c789,name_1_1)
& val(c789,bmw_0)
& sub(c791,abschlu__337_1_1)
& assoc(c792,c791)
& sub(c792,ja_nuar_1_1)
& subs(c799,ankauf__1_1)
& agt(c840,c788)
& mcont(c840,c799)
& subs(c840,bekanntgeben_1_1)
& temp(c840,c792)
& attch(c842,c799)
& attr(c842,c843)
& prop(c842,britisch__1_1)
& sub(c842,autobauer_1_1)
& sub(c843,name_1_1)
& val(c843,rover_0)
& sort(autobauer_1_1,d)
& sort(autobauer_1_1,io)
& card(autobauer_1_1,int1)
& etype(autobauer_1_1,int0)
& fact(autobauer_1_1,real)
& gener(autobauer_1_1,ge)
& quant(autobauer_1_1,one)
& refer(autobauer_1_1,refer_c)
& varia(autobauer_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(fabrikant_1_1,d)
& sort(fabrikant_1_1,io)
& card(fabrikant_1_1,int1)
& etype(fabrikant_1_1,int0)
& fact(fabrikant_1_1,real)
& gener(fabrikant_1_1,ge)
& quant(fabrikant_1_1,one)
& refer(fabrikant_1_1,refer_c)
& varia(fabrikant_1_1,varia_c)
& sort(c788,d)
& sort(c788,io)
& card(c788,int1)
& etype(c788,int0)
& fact(c788,real)
& gener(c788,sp)
& quant(c788,one)
& refer(c788,det)
& varia(c788,con)
& sort(c789,na)
& card(c789,int1)
& etype(c789,int0)
& fact(c789,real)
& gener(c789,sp)
& quant(c789,one)
& refer(c789,indet)
& varia(c789,varia_c)
& sort(firma_1_1,d)
& sort(firma_1_1,io)
& card(firma_1_1,int1)
& etype(firma_1_1,int0)
& fact(firma_1_1,real)
& gener(firma_1_1,ge)
& quant(firma_1_1,one)
& refer(firma_1_1,refer_c)
& varia(firma_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(bmw_0,fe)
& sort(c791,ad)
& sort(c791,io)
& card(c791,int1)
& etype(c791,int0)
& fact(c791,real)
& gener(c791,gener_c)
& quant(c791,one)
& refer(c791,refer_c)
& varia(c791,varia_c)
& sort(abschlu__337_1_1,ad)
& sort(abschlu__337_1_1,io)
& card(abschlu__337_1_1,int1)
& etype(abschlu__337_1_1,int0)
& fact(abschlu__337_1_1,real)
& gener(abschlu__337_1_1,ge)
& quant(abschlu__337_1_1,one)
& refer(abschlu__337_1_1,refer_c)
& varia(abschlu__337_1_1,varia_c)
& sort(c792,ta)
& card(c792,int1)
& etype(c792,int0)
& fact(c792,real)
& gener(c792,sp)
& quant(c792,one)
& refer(c792,refer_c)
& varia(c792,varia_c)
& sort(ja_nuar_1_1,ta)
& card(ja_nuar_1_1,int1)
& etype(ja_nuar_1_1,int0)
& fact(ja_nuar_1_1,real)
& gener(ja_nuar_1_1,ge)
& quant(ja_nuar_1_1,one)
& refer(ja_nuar_1_1,refer_c)
& varia(ja_nuar_1_1,varia_c)
& sort(c799,ad)
& card(c799,int1)
& etype(c799,int0)
& fact(c799,hypo)
& gener(c799,sp)
& quant(c799,one)
& refer(c799,det)
& varia(c799,con)
& sort(ankauf__1_1,ad)
& card(ankauf__1_1,int1)
& etype(ankauf__1_1,int0)
& fact(ankauf__1_1,real)
& gener(ankauf__1_1,ge)
& quant(ankauf__1_1,one)
& refer(ankauf__1_1,refer_c)
& varia(ankauf__1_1,varia_c)
& sort(c840,da)
& fact(c840,real)
& gener(c840,sp)
& sort(bekanntgeben_1_1,da)
& fact(bekanntgeben_1_1,real)
& gener(bekanntgeben_1_1,ge)
& sort(c842,d)
& sort(c842,io)
& card(c842,int1)
& etype(c842,int0)
& fact(c842,real)
& gener(c842,sp)
& quant(c842,one)
& refer(c842,det)
& varia(c842,con)
& sort(c843,na)
& card(c843,int1)
& etype(c843,int0)
& fact(c843,real)
& gener(c843,sp)
& quant(c843,one)
& refer(c843,indet)
& varia(c843,varia_c)
& sort(britisch__1_1,nq)
& sort(rover_0,fe) ),
file('/export/starexec/sandbox2/tmp/tmp.ToHknYMDyM/E---3.1_19516.p',ave07_era5_synth_qa07_007_mira_news_1243) ).
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(X1,firma_1_1)
& sub(X3,name_1_1)
& val(X2,bmw_0)
& val(X3,bmw_0) ),
inference(assume_negation,[status(cth)],[synth_qa07_007_mira_news_1243]) ).
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(X8,firma_1_1)
| ~ sub(X10,name_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(X3,firma_1_1)
| ~ sub(X5,name_1_1)
| ~ val(X4,bmw_0)
| ~ val(X5,bmw_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,hypothesis,
agt(c840,c788),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1243]) ).
cnf(c_0_6,hypothesis,
( ~ val(X1,bmw_0)
| ~ val(X2,bmw_0)
| ~ attr(c788,X1)
| ~ attr(X3,X4)
| ~ attr(X5,X2)
| ~ sub(X1,name_1_1)
| ~ sub(X2,name_1_1)
| ~ sub(X5,firma_1_1) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,hypothesis,
attr(c842,c843),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1243]) ).
cnf(c_0_8,hypothesis,
( ~ val(X1,bmw_0)
| ~ val(X2,bmw_0)
| ~ attr(c788,X1)
| ~ attr(X3,X2)
| ~ sub(X1,name_1_1)
| ~ sub(X2,name_1_1)
| ~ sub(X3,firma_1_1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,hypothesis,
attr(c788,c789),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1243]) ).
cnf(c_0_10,hypothesis,
val(c789,bmw_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1243]) ).
cnf(c_0_11,hypothesis,
sub(c789,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1243]) ).
cnf(c_0_12,hypothesis,
sub(c788,firma_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1243]) ).
cnf(c_0_13,hypothesis,
( ~ val(X1,bmw_0)
| ~ attr(c788,X1)
| ~ sub(X1,name_1_1) ),
inference(cn,[status(thm)],[inference(rw,[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]),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_9]),c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 1.07/1.13 % Problem : CSR115+40 : TPTP v8.1.2. Released v4.0.0.
% 1.07/1.14 % Command : run_E %s %d THM
% 1.13/1.34 % Computer : n013.cluster.edu
% 1.13/1.34 % Model : x86_64 x86_64
% 1.13/1.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.13/1.34 % Memory : 8042.1875MB
% 1.13/1.34 % OS : Linux 3.10.0-693.el7.x86_64
% 1.13/1.34 % CPULimit : 300
% 1.13/1.34 % WCLimit : 300
% 1.13/1.34 % DateTime : Fri May 3 15:18:09 EDT 2024
% 1.13/1.35 % CPUTime :
% 2.35/2.54 Running first-order theorem proving
% 2.35/2.54 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.ToHknYMDyM/E---3.1_19516.p
% 3.19/2.76 # Version: 3.1.0
% 3.19/2.76 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.19/2.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.19/2.76 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.19/2.76 # Starting new_bool_3 with 300s (1) cores
% 3.19/2.76 # Starting new_bool_1 with 300s (1) cores
% 3.19/2.76 # Starting sh5l with 300s (1) cores
% 3.19/2.76 # new_bool_3 with pid 19599 completed with status 0
% 3.19/2.76 # Result found by new_bool_3
% 3.19/2.76 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.19/2.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.19/2.76 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.19/2.76 # Starting new_bool_3 with 300s (1) cores
% 3.19/2.76 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.19/2.76 # Search class: FHHNF-FFMM33-SFFFFFNN
% 3.19/2.76 # partial match(1): FGHNF-FFMM33-SFFFFFNN
% 3.19/2.76 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.19/2.76 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 3.19/2.76 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 19602 completed with status 0
% 3.19/2.76 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 3.19/2.76 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.19/2.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.19/2.76 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.19/2.76 # Starting new_bool_3 with 300s (1) cores
% 3.19/2.76 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.19/2.76 # Search class: FHHNF-FFMM33-SFFFFFNN
% 3.19/2.76 # partial match(1): FGHNF-FFMM33-SFFFFFNN
% 3.19/2.76 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.19/2.76 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 3.19/2.76 # Preprocessing time : 0.013 s
% 3.19/2.76 # Presaturation interreduction done
% 3.19/2.76
% 3.19/2.76 # Proof found!
% 3.19/2.76 # SZS status Theorem
% 3.19/2.76 # SZS output start CNFRefutation
% See solution above
% 3.19/2.76 # Parsed axioms : 10189
% 3.19/2.76 # Removed by relevancy pruning/SinE : 10131
% 3.19/2.76 # Initial clauses : 223
% 3.19/2.76 # Removed in clause preprocessing : 0
% 3.19/2.76 # Initial clauses in saturation : 223
% 3.19/2.76 # Processed clauses : 483
% 3.19/2.76 # ...of these trivial : 0
% 3.19/2.76 # ...subsumed : 0
% 3.19/2.76 # ...remaining for further processing : 483
% 3.19/2.76 # Other redundant clauses eliminated : 0
% 3.19/2.76 # Clauses deleted for lack of memory : 0
% 3.19/2.76 # Backward-subsumed : 2
% 3.19/2.76 # Backward-rewritten : 0
% 3.19/2.76 # Generated clauses : 202
% 3.19/2.76 # ...of the previous two non-redundant : 201
% 3.19/2.76 # ...aggressively subsumed : 0
% 3.19/2.76 # Contextual simplify-reflections : 0
% 3.19/2.76 # Paramodulations : 202
% 3.19/2.76 # Factorizations : 0
% 3.19/2.76 # NegExts : 0
% 3.19/2.76 # Equation resolutions : 0
% 3.19/2.76 # Disequality decompositions : 0
% 3.19/2.76 # Total rewrite steps : 8
% 3.19/2.76 # ...of those cached : 4
% 3.19/2.76 # Propositional unsat checks : 0
% 3.19/2.76 # Propositional check models : 0
% 3.19/2.76 # Propositional check unsatisfiable : 0
% 3.19/2.76 # Propositional clauses : 0
% 3.19/2.76 # Propositional clauses after purity: 0
% 3.19/2.76 # Propositional unsat core size : 0
% 3.19/2.76 # Propositional preprocessing time : 0.000
% 3.19/2.76 # Propositional encoding time : 0.000
% 3.19/2.76 # Propositional solver time : 0.000
% 3.19/2.76 # Success case prop preproc time : 0.000
% 3.19/2.76 # Success case prop encoding time : 0.000
% 3.19/2.76 # Success case prop solver time : 0.000
% 3.19/2.76 # Current number of processed clauses : 258
% 3.19/2.76 # Positive orientable unit clauses : 207
% 3.19/2.76 # Positive unorientable unit clauses: 0
% 3.19/2.76 # Negative unit clauses : 0
% 3.19/2.76 # Non-unit-clauses : 51
% 3.19/2.76 # Current number of unprocessed clauses: 164
% 3.19/2.76 # ...number of literals in the above : 271
% 3.19/2.76 # Current number of archived formulas : 0
% 3.19/2.76 # Current number of archived clauses : 225
% 3.19/2.76 # Clause-clause subsumption calls (NU) : 1956
% 3.19/2.76 # Rec. Clause-clause subsumption calls : 836
% 3.19/2.76 # Non-unit clause-clause subsumptions : 2
% 3.19/2.76 # Unit Clause-clause subsumption calls : 10
% 3.19/2.76 # Rewrite failures with RHS unbound : 0
% 3.19/2.76 # BW rewrite match attempts : 0
% 3.19/2.76 # BW rewrite match successes : 0
% 3.19/2.76 # Condensation attempts : 0
% 3.19/2.76 # Condensation successes : 0
% 3.19/2.76 # Termbank termtop insertions : 51814
% 3.19/2.76 # Search garbage collected termcells : 38951
% 3.19/2.76
% 3.19/2.76 # -------------------------------------------------
% 3.19/2.76 # User time : 0.077 s
% 3.19/2.76 # System time : 0.059 s
% 3.19/2.76 # Total time : 0.136 s
% 3.19/2.76 # Maximum resident set size: 42556 pages
% 3.19/2.76
% 3.19/2.76 # -------------------------------------------------
% 3.19/2.76 # User time : 0.117 s
% 3.19/2.76 # System time : 0.066 s
% 3.19/2.76 # Total time : 0.184 s
% 3.19/2.76 # Maximum resident set size: 10796 pages
% 3.19/2.76 % E---3.1 exiting
% 3.19/2.76 % E exiting
%------------------------------------------------------------------------------