TSTP Solution File: CSR115+70 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : CSR115+70 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 Jun 24 05:06:54 EDT 2024
% Result : Theorem 1.86s 1.89s
% Output : CNFRefutation 1.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 6 unt; 0 def)
% Number of atoms : 215 ( 0 equ)
% Maximal formula atoms : 79 ( 7 avg)
% Number of connectives : 272 ( 84 ~; 72 |; 114 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 79 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 20 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 36 ( 36 usr; 32 con; 0-3 aty)
% Number of variables : 87 ( 32 sgn 17 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_007_mira_wp_480,conjecture,
? [X1,X2,X3,X4,X5,X6,X7] :
( attr(X1,X2)
& attr(X4,X3)
& attr(X6,X7)
& obj(X5,X1)
& 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.qG9Q3B0PJx/E---3.1_22379.p',synth_qa07_007_mira_wp_480) ).
fof(ave07_era5_synth_qa07_007_mira_wp_480,hypothesis,
( arg1(c11,c3)
& arg2(c11,c25)
& subs(c11,behandeln_1_1)
& sub(c25,geschichte_1_1)
& mcont(c3,c25)
& attch(c40,c25)
& attr(c40,c41)
& sub(c40,firma_1_1)
& sub(c41,name_1_1)
& val(c41,bmw_0)
& sort(c11,st)
& fact(c11,real)
& gener(c11,sp)
& sort(c3,o)
& card(c3,int1)
& etype(c3,int0)
& fact(c3,real)
& gener(c3,sp)
& quant(c3,one)
& refer(c3,det)
& varia(c3,varia_c)
& sort(c25,ad)
& sort(c25,d)
& sort(c25,io)
& card(c25,int1)
& etype(c25,int0)
& fact(c25,hypo)
& gener(c25,sp)
& quant(c25,one)
& refer(c25,det)
& varia(c25,con)
& sort(behandeln_1_1,st)
& fact(behandeln_1_1,real)
& gener(behandeln_1_1,ge)
& sort(geschichte_1_1,ad)
& sort(geschichte_1_1,d)
& sort(geschichte_1_1,io)
& card(geschichte_1_1,int1)
& etype(geschichte_1_1,int0)
& fact(geschichte_1_1,real)
& gener(geschichte_1_1,ge)
& quant(geschichte_1_1,one)
& refer(geschichte_1_1,refer_c)
& varia(geschichte_1_1,varia_c)
& sort(c40,d)
& sort(c40,io)
& card(c40,int1)
& etype(c40,int0)
& fact(c40,real)
& gener(c40,sp)
& quant(c40,one)
& refer(c40,det)
& varia(c40,con)
& sort(c41,na)
& card(c41,int1)
& etype(c41,int0)
& fact(c41,real)
& gener(c41,sp)
& quant(c41,one)
& refer(c41,indet)
& varia(c41,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) ),
file('/export/starexec/sandbox2/tmp/tmp.qG9Q3B0PJx/E---3.1_22379.p',ave07_era5_synth_qa07_007_mira_wp_480) ).
fof(sub__bezeichnen_1_1_als,axiom,
! [X1,X2,X3] :
( ( arg1(X1,X2)
& arg2(X1,X3)
& subr(X1,sub_0) )
=> ? [X4,X5,X6] :
( arg1(X5,X2)
& arg2(X5,X6)
& hsit(X1,X4)
& mcont(X4,X5)
& obj(X4,X2)
& sub(X6,X3)
& subr(X5,rprs_0)
& subs(X4,bezeichnen_1_1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qG9Q3B0PJx/E---3.1_22379.p',sub__bezeichnen_1_1_als) ).
fof(sub__sub_0_expansion,axiom,
! [X1,X2] :
( sub(X1,X2)
=> ? [X3] :
( arg1(X3,X1)
& arg2(X3,X2)
& subr(X3,sub_0) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qG9Q3B0PJx/E---3.1_22379.p',sub__sub_0_expansion) ).
fof(c_0_4,negated_conjecture,
~ ? [X1,X2,X3,X4,X5,X6,X7] :
( attr(X1,X2)
& attr(X4,X3)
& attr(X6,X7)
& obj(X5,X1)
& 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_wp_480]) ).
fof(c_0_5,negated_conjecture,
! [X8,X9,X10,X11,X12,X13,X14] :
( ~ attr(X8,X9)
| ~ attr(X11,X10)
| ~ attr(X13,X14)
| ~ obj(X12,X8)
| ~ 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_4])])]) ).
cnf(c_0_6,negated_conjecture,
( ~ attr(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ obj(X7,X1)
| ~ sub(X2,name_1_1)
| ~ sub(X1,firma_1_1)
| ~ sub(X4,name_1_1)
| ~ val(X2,bmw_0)
| ~ val(X4,bmw_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,hypothesis,
val(c41,bmw_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_480]) ).
cnf(c_0_8,hypothesis,
sub(c41,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_480]) ).
cnf(c_0_9,hypothesis,
( ~ val(X1,bmw_0)
| ~ attr(X2,c41)
| ~ attr(X3,X4)
| ~ attr(X5,X1)
| ~ obj(X6,X5)
| ~ sub(X1,name_1_1)
| ~ sub(X5,firma_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).
cnf(c_0_10,hypothesis,
( ~ attr(X1,c41)
| ~ attr(X2,c41)
| ~ attr(X3,X4)
| ~ obj(X5,X2)
| ~ sub(X2,firma_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_7]),c_0_8])]) ).
cnf(c_0_11,hypothesis,
attr(c40,c41),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_480]) ).
cnf(c_0_12,hypothesis,
( ~ attr(X1,c41)
| ~ attr(X2,X3)
| ~ obj(X4,X1)
| ~ sub(X1,firma_1_1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,hypothesis,
sub(c40,firma_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_480]) ).
fof(c_0_14,plain,
! [X146,X147,X148] :
( ( arg1(esk19_3(X146,X147,X148),X147)
| ~ arg1(X146,X147)
| ~ arg2(X146,X148)
| ~ subr(X146,sub_0) )
& ( arg2(esk19_3(X146,X147,X148),esk20_3(X146,X147,X148))
| ~ arg1(X146,X147)
| ~ arg2(X146,X148)
| ~ subr(X146,sub_0) )
& ( hsit(X146,esk18_3(X146,X147,X148))
| ~ arg1(X146,X147)
| ~ arg2(X146,X148)
| ~ subr(X146,sub_0) )
& ( mcont(esk18_3(X146,X147,X148),esk19_3(X146,X147,X148))
| ~ arg1(X146,X147)
| ~ arg2(X146,X148)
| ~ subr(X146,sub_0) )
& ( obj(esk18_3(X146,X147,X148),X147)
| ~ arg1(X146,X147)
| ~ arg2(X146,X148)
| ~ subr(X146,sub_0) )
& ( sub(esk20_3(X146,X147,X148),X148)
| ~ arg1(X146,X147)
| ~ arg2(X146,X148)
| ~ subr(X146,sub_0) )
& ( subr(esk19_3(X146,X147,X148),rprs_0)
| ~ arg1(X146,X147)
| ~ arg2(X146,X148)
| ~ subr(X146,sub_0) )
& ( subs(esk18_3(X146,X147,X148),bezeichnen_1_1)
| ~ arg1(X146,X147)
| ~ arg2(X146,X148)
| ~ subr(X146,sub_0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sub__bezeichnen_1_1_als])])])])])]) ).
cnf(c_0_15,hypothesis,
( ~ attr(X1,X2)
| ~ obj(X3,c40) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_11]),c_0_13])]) ).
cnf(c_0_16,plain,
( obj(esk18_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X167,X168] :
( ( arg1(esk24_2(X167,X168),X167)
| ~ sub(X167,X168) )
& ( arg2(esk24_2(X167,X168),X168)
| ~ sub(X167,X168) )
& ( subr(esk24_2(X167,X168),sub_0)
| ~ sub(X167,X168) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sub__sub_0_expansion])])])])]) ).
cnf(c_0_18,hypothesis,
( ~ subr(X1,sub_0)
| ~ attr(X2,X3)
| ~ arg2(X1,X4)
| ~ arg1(X1,c40) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( subr(esk24_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,hypothesis,
( ~ attr(X1,X2)
| ~ arg2(esk24_2(X3,X4),X5)
| ~ arg1(esk24_2(X3,X4),c40)
| ~ sub(X3,X4) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
( arg1(esk24_2(X1,X2),X1)
| ~ sub(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,hypothesis,
( ~ attr(X1,X2)
| ~ arg2(esk24_2(c40,X3),X4)
| ~ sub(c40,X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
( arg2(esk24_2(X1,X2),X2)
| ~ sub(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,hypothesis,
( ~ attr(X1,X2)
| ~ sub(c40,X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,hypothesis,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_13]) ).
cnf(c_0_26,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_11,c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : CSR115+70 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n002.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Jun 20 00:16:39 EDT 2024
% 0.12/0.34 % CPUTime :
% 1.41/1.60 Running first-order theorem proving
% 1.41/1.60 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.qG9Q3B0PJx/E---3.1_22379.p
% 1.86/1.89 # Version: 3.2.0
% 1.86/1.89 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.86/1.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.86/1.89 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.86/1.89 # Starting new_bool_3 with 300s (1) cores
% 1.86/1.89 # Starting new_bool_1 with 300s (1) cores
% 1.86/1.89 # Starting sh5l with 300s (1) cores
% 1.86/1.89 # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 22457 completed with status 0
% 1.86/1.89 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 1.86/1.89 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.86/1.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.86/1.89 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.86/1.89 # SinE strategy is gf500_h_gu_R04_F100_L20000
% 1.86/1.89 # Search class: FHHNS-FSLM32-MFFFFFNN
% 1.86/1.89 # partial match(2): FHHNS-SMLM32-MFFFFFNN
% 1.86/1.89 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.86/1.89 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.86/1.89 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 1.86/1.89 # Starting new_bool_3 with 136s (1) cores
% 1.86/1.89 # Starting new_bool_1 with 136s (1) cores
% 1.86/1.89 # Starting sh5l with 136s (1) cores
% 1.86/1.89 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 22463 completed with status 0
% 1.86/1.89 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1.86/1.89 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.86/1.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.86/1.89 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.86/1.89 # SinE strategy is gf500_h_gu_R04_F100_L20000
% 1.86/1.89 # Search class: FHHNS-FSLM32-MFFFFFNN
% 1.86/1.89 # partial match(2): FHHNS-SMLM32-MFFFFFNN
% 1.86/1.89 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.86/1.89 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.86/1.89 # Preprocessing time : 0.011 s
% 1.86/1.89 # Presaturation interreduction done
% 1.86/1.89
% 1.86/1.89 # Proof found!
% 1.86/1.89 # SZS status Theorem
% 1.86/1.89 # SZS output start CNFRefutation
% See solution above
% 1.86/1.89 # Parsed axioms : 10189
% 1.86/1.89 # Removed by relevancy pruning/SinE : 9952
% 1.86/1.89 # Initial clauses : 468
% 1.86/1.89 # Removed in clause preprocessing : 0
% 1.86/1.89 # Initial clauses in saturation : 468
% 1.86/1.89 # Processed clauses : 948
% 1.86/1.89 # ...of these trivial : 0
% 1.86/1.89 # ...subsumed : 1
% 1.86/1.89 # ...remaining for further processing : 947
% 1.86/1.89 # Other redundant clauses eliminated : 0
% 1.86/1.89 # Clauses deleted for lack of memory : 0
% 1.86/1.89 # Backward-subsumed : 17
% 1.86/1.89 # Backward-rewritten : 0
% 1.86/1.89 # Generated clauses : 481
% 1.86/1.89 # ...of the previous two non-redundant : 480
% 1.86/1.89 # ...aggressively subsumed : 0
% 1.86/1.89 # Contextual simplify-reflections : 0
% 1.86/1.89 # Paramodulations : 480
% 1.86/1.89 # Factorizations : 0
% 1.86/1.89 # NegExts : 0
% 1.86/1.89 # Equation resolutions : 0
% 1.86/1.89 # Disequality decompositions : 0
% 1.86/1.89 # Total rewrite steps : 4
% 1.86/1.89 # ...of those cached : 1
% 1.86/1.89 # Propositional unsat checks : 0
% 1.86/1.89 # Propositional check models : 0
% 1.86/1.89 # Propositional check unsatisfiable : 0
% 1.86/1.89 # Propositional clauses : 0
% 1.86/1.89 # Propositional clauses after purity: 0
% 1.86/1.89 # Propositional unsat core size : 0
% 1.86/1.89 # Propositional preprocessing time : 0.000
% 1.86/1.89 # Propositional encoding time : 0.000
% 1.86/1.89 # Propositional solver time : 0.000
% 1.86/1.89 # Success case prop preproc time : 0.000
% 1.86/1.89 # Success case prop encoding time : 0.000
% 1.86/1.89 # Success case prop solver time : 0.000
% 1.86/1.89 # Current number of processed clauses : 461
% 1.86/1.89 # Positive orientable unit clauses : 258
% 1.86/1.89 # Positive unorientable unit clauses: 0
% 1.86/1.89 # Negative unit clauses : 1
% 1.86/1.89 # Non-unit-clauses : 202
% 1.86/1.89 # Current number of unprocessed clauses: 468
% 1.86/1.89 # ...number of literals in the above : 1514
% 1.86/1.89 # Current number of archived formulas : 0
% 1.86/1.89 # Current number of archived clauses : 486
% 1.86/1.89 # Clause-clause subsumption calls (NU) : 30157
% 1.86/1.89 # Rec. Clause-clause subsumption calls : 12889
% 1.86/1.89 # Non-unit clause-clause subsumptions : 4
% 1.86/1.89 # Unit Clause-clause subsumption calls : 168
% 1.86/1.89 # Rewrite failures with RHS unbound : 0
% 1.86/1.89 # BW rewrite match attempts : 0
% 1.86/1.89 # BW rewrite match successes : 0
% 1.86/1.89 # Condensation attempts : 0
% 1.86/1.89 # Condensation successes : 0
% 1.86/1.89 # Termbank termtop insertions : 72447
% 1.86/1.89 # Search garbage collected termcells : 40694
% 1.86/1.89
% 1.86/1.89 # -------------------------------------------------
% 1.86/1.89 # User time : 0.101 s
% 1.86/1.89 # System time : 0.072 s
% 1.86/1.89 # Total time : 0.173 s
% 1.86/1.89 # Maximum resident set size: 47908 pages
% 1.86/1.89
% 1.86/1.89 # -------------------------------------------------
% 1.86/1.89 # User time : 0.582 s
% 1.86/1.89 # System time : 0.137 s
% 1.86/1.89 # Total time : 0.720 s
% 1.86/1.89 # Maximum resident set size: 10756 pages
% 1.86/1.89 % E---3.1 exiting
% 1.86/1.89 % E exiting
%------------------------------------------------------------------------------