TSTP Solution File: CSR115+79 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR115+79 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:37:57 EDT 2024
% Result : Theorem 2.52s 1.86s
% Output : CNFRefutation 2.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 6 unt; 0 def)
% Number of atoms : 264 ( 0 equ)
% Maximal formula atoms : 128 ( 9 avg)
% Number of connectives : 321 ( 84 ~; 72 |; 163 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 128 ( 11 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 22 ( 21 usr; 1 prp; 0-5 aty)
% Number of functors : 42 ( 42 usr; 38 con; 0-3 aty)
% Number of variables : 87 ( 32 sgn 17 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_007_mira_wp_489,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/sandbox/tmp/tmp.Fe9XLSHf7U/E---3.1_23780.p',synth_qa07_007_mira_wp_489) ).
fof(ave07_era5_synth_qa07_007_mira_wp_489,hypothesis,
( sub(c104,roadster_1_1)
& attr(c129,c130)
& sub(c129,firma_1_1)
& sub(c130,name_1_1)
& val(c130,bmw_0)
& sub(c134,basis_1_1)
& sub(c138,standbein_1_1)
& attch(c142,c138)
& sub(c142,firma_1_1)
& tupl_p5(c287,c104,c129,c134,c138)
& assoc(standbein_1_1,stand_1_1)
& sub(standbein_1_1,bein_1_1)
& sort(c104,d)
& card(c104,int1)
& etype(c104,int0)
& fact(c104,real)
& gener(c104,gener_c)
& quant(c104,one)
& refer(c104,refer_c)
& varia(c104,varia_c)
& sort(roadster_1_1,d)
& card(roadster_1_1,int1)
& etype(roadster_1_1,int0)
& fact(roadster_1_1,real)
& gener(roadster_1_1,ge)
& quant(roadster_1_1,one)
& refer(roadster_1_1,refer_c)
& varia(roadster_1_1,varia_c)
& sort(c129,d)
& sort(c129,io)
& card(c129,int1)
& etype(c129,int0)
& fact(c129,real)
& gener(c129,sp)
& quant(c129,one)
& refer(c129,det)
& varia(c129,con)
& sort(c130,na)
& card(c130,int1)
& etype(c130,int0)
& fact(c130,real)
& gener(c130,sp)
& quant(c130,one)
& refer(c130,indet)
& varia(c130,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(c134,io)
& card(c134,int1)
& etype(c134,int0)
& fact(c134,real)
& gener(c134,gener_c)
& quant(c134,one)
& refer(c134,refer_c)
& varia(c134,varia_c)
& sort(basis_1_1,io)
& card(basis_1_1,int1)
& etype(basis_1_1,int0)
& fact(basis_1_1,real)
& gener(basis_1_1,ge)
& quant(basis_1_1,one)
& refer(basis_1_1,refer_c)
& varia(basis_1_1,varia_c)
& sort(c138,d)
& card(c138,int1)
& etype(c138,int0)
& fact(c138,real)
& gener(c138,sp)
& quant(c138,one)
& refer(c138,det)
& varia(c138,con)
& sort(standbein_1_1,d)
& card(standbein_1_1,int1)
& etype(standbein_1_1,int0)
& fact(standbein_1_1,real)
& gener(standbein_1_1,ge)
& quant(standbein_1_1,one)
& refer(standbein_1_1,refer_c)
& varia(standbein_1_1,varia_c)
& sort(c142,d)
& sort(c142,io)
& card(c142,int1)
& etype(c142,int0)
& fact(c142,real)
& gener(c142,sp)
& quant(c142,one)
& refer(c142,det)
& varia(c142,con)
& sort(c287,ent)
& card(c287,card_c)
& etype(c287,etype_c)
& fact(c287,real)
& gener(c287,gener_c)
& quant(c287,quant_c)
& refer(c287,refer_c)
& varia(c287,varia_c)
& sort(stand_1_1,d)
& card(stand_1_1,int1)
& etype(stand_1_1,int0)
& fact(stand_1_1,real)
& gener(stand_1_1,ge)
& quant(stand_1_1,one)
& refer(stand_1_1,refer_c)
& varia(stand_1_1,varia_c)
& sort(bein_1_1,d)
& card(bein_1_1,int1)
& etype(bein_1_1,int0)
& fact(bein_1_1,real)
& gener(bein_1_1,ge)
& quant(bein_1_1,one)
& refer(bein_1_1,refer_c)
& varia(bein_1_1,varia_c) ),
file('/export/starexec/sandbox/tmp/tmp.Fe9XLSHf7U/E---3.1_23780.p',ave07_era5_synth_qa07_007_mira_wp_489) ).
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/sandbox/tmp/tmp.Fe9XLSHf7U/E---3.1_23780.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/sandbox/tmp/tmp.Fe9XLSHf7U/E---3.1_23780.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_489]) ).
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(c130,bmw_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_489]) ).
cnf(c_0_8,hypothesis,
sub(c130,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_489]) ).
cnf(c_0_9,hypothesis,
( ~ val(X1,bmw_0)
| ~ attr(X2,c130)
| ~ 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,c130)
| ~ attr(X2,c130)
| ~ 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(c129,c130),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_489]) ).
cnf(c_0_12,hypothesis,
( ~ attr(X1,c130)
| ~ 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(c129,firma_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_489]) ).
fof(c_0_14,plain,
! [X360,X361,X362] :
( ( arg1(esk47_3(X360,X361,X362),X361)
| ~ arg1(X360,X361)
| ~ arg2(X360,X362)
| ~ subr(X360,sub_0) )
& ( arg2(esk47_3(X360,X361,X362),esk48_3(X360,X361,X362))
| ~ arg1(X360,X361)
| ~ arg2(X360,X362)
| ~ subr(X360,sub_0) )
& ( hsit(X360,esk46_3(X360,X361,X362))
| ~ arg1(X360,X361)
| ~ arg2(X360,X362)
| ~ subr(X360,sub_0) )
& ( mcont(esk46_3(X360,X361,X362),esk47_3(X360,X361,X362))
| ~ arg1(X360,X361)
| ~ arg2(X360,X362)
| ~ subr(X360,sub_0) )
& ( obj(esk46_3(X360,X361,X362),X361)
| ~ arg1(X360,X361)
| ~ arg2(X360,X362)
| ~ subr(X360,sub_0) )
& ( sub(esk48_3(X360,X361,X362),X362)
| ~ arg1(X360,X361)
| ~ arg2(X360,X362)
| ~ subr(X360,sub_0) )
& ( subr(esk47_3(X360,X361,X362),rprs_0)
| ~ arg1(X360,X361)
| ~ arg2(X360,X362)
| ~ subr(X360,sub_0) )
& ( subs(esk46_3(X360,X361,X362),bezeichnen_1_1)
| ~ arg1(X360,X361)
| ~ arg2(X360,X362)
| ~ subr(X360,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,c129) ),
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(esk46_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,
! [X366,X367] :
( ( arg1(esk49_2(X366,X367),X366)
| ~ sub(X366,X367) )
& ( arg2(esk49_2(X366,X367),X367)
| ~ sub(X366,X367) )
& ( subr(esk49_2(X366,X367),sub_0)
| ~ sub(X366,X367) ) ),
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,c129) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( subr(esk49_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(esk49_2(X3,X4),X5)
| ~ arg1(esk49_2(X3,X4),c129)
| ~ sub(X3,X4) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
( arg1(esk49_2(X1,X2),X1)
| ~ sub(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,hypothesis,
( ~ attr(X1,X2)
| ~ arg2(esk49_2(c129,X3),X4)
| ~ sub(c129,X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
( arg2(esk49_2(X1,X2),X2)
| ~ sub(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,hypothesis,
( ~ attr(X1,X2)
| ~ sub(c129,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.07/0.12 % Problem : CSR115+79 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 15:13:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 1.30/1.51 Running first-order model finding
% 1.30/1.51 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.Fe9XLSHf7U/E---3.1_23780.p
% 2.52/1.86 # Version: 3.1.0
% 2.52/1.86 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.52/1.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.52/1.86 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.52/1.86 # Starting new_bool_3 with 300s (1) cores
% 2.52/1.86 # Starting new_bool_1 with 300s (1) cores
% 2.52/1.86 # Starting sh5l with 300s (1) cores
% 2.52/1.86 # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 23936 completed with status 0
% 2.52/1.86 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 2.52/1.86 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.52/1.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.52/1.86 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.52/1.86 # SinE strategy is gf500_h_gu_R04_F100_L20000
% 2.52/1.86 # Search class: FHHNS-FSLM32-MFFFFFNN
% 2.52/1.86 # partial match(2): FHHNS-SMLM32-MFFFFFNN
% 2.52/1.86 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.52/1.86 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 2.52/1.86 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 2.52/1.86 # Starting new_bool_3 with 136s (1) cores
% 2.52/1.86 # Starting new_bool_1 with 136s (1) cores
% 2.52/1.86 # Starting sh5l with 136s (1) cores
% 2.52/1.86 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 23947 completed with status 0
% 2.52/1.86 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 2.52/1.86 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.52/1.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.52/1.86 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.52/1.86 # SinE strategy is gf500_h_gu_R04_F100_L20000
% 2.52/1.86 # Search class: FHHNS-FSLM32-MFFFFFNN
% 2.52/1.86 # partial match(2): FHHNS-SMLM32-MFFFFFNN
% 2.52/1.86 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.52/1.86 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 2.52/1.86 # Preprocessing time : 0.019 s
% 2.52/1.86 # Presaturation interreduction done
% 2.52/1.86
% 2.52/1.86 # Proof found!
% 2.52/1.86 # SZS status Theorem
% 2.52/1.86 # SZS output start CNFRefutation
% See solution above
% 2.52/1.86 # Parsed axioms : 10189
% 2.52/1.86 # Removed by relevancy pruning/SinE : 9955
% 2.52/1.86 # Initial clauses : 514
% 2.52/1.86 # Removed in clause preprocessing : 0
% 2.52/1.86 # Initial clauses in saturation : 514
% 2.52/1.86 # Processed clauses : 1035
% 2.52/1.86 # ...of these trivial : 0
% 2.52/1.86 # ...subsumed : 2
% 2.52/1.86 # ...remaining for further processing : 1033
% 2.52/1.86 # Other redundant clauses eliminated : 0
% 2.52/1.86 # Clauses deleted for lack of memory : 0
% 2.52/1.86 # Backward-subsumed : 19
% 2.52/1.86 # Backward-rewritten : 0
% 2.52/1.86 # Generated clauses : 445
% 2.52/1.86 # ...of the previous two non-redundant : 444
% 2.52/1.86 # ...aggressively subsumed : 0
% 2.52/1.86 # Contextual simplify-reflections : 1
% 2.52/1.86 # Paramodulations : 444
% 2.52/1.86 # Factorizations : 0
% 2.52/1.86 # NegExts : 0
% 2.52/1.86 # Equation resolutions : 0
% 2.52/1.86 # Disequality decompositions : 0
% 2.52/1.86 # Total rewrite steps : 4
% 2.52/1.86 # ...of those cached : 1
% 2.52/1.86 # Propositional unsat checks : 0
% 2.52/1.86 # Propositional check models : 0
% 2.52/1.86 # Propositional check unsatisfiable : 0
% 2.52/1.86 # Propositional clauses : 0
% 2.52/1.86 # Propositional clauses after purity: 0
% 2.52/1.86 # Propositional unsat core size : 0
% 2.52/1.86 # Propositional preprocessing time : 0.000
% 2.52/1.86 # Propositional encoding time : 0.000
% 2.52/1.86 # Propositional solver time : 0.000
% 2.52/1.86 # Success case prop preproc time : 0.000
% 2.52/1.86 # Success case prop encoding time : 0.000
% 2.52/1.86 # Success case prop solver time : 0.000
% 2.52/1.86 # Current number of processed clauses : 499
% 2.52/1.86 # Positive orientable unit clauses : 306
% 2.52/1.86 # Positive unorientable unit clauses: 0
% 2.52/1.86 # Negative unit clauses : 1
% 2.52/1.86 # Non-unit-clauses : 192
% 2.52/1.86 # Current number of unprocessed clauses: 437
% 2.52/1.86 # ...number of literals in the above : 1483
% 2.52/1.86 # Current number of archived formulas : 0
% 2.52/1.86 # Current number of archived clauses : 534
% 2.52/1.86 # Clause-clause subsumption calls (NU) : 32274
% 2.52/1.86 # Rec. Clause-clause subsumption calls : 13193
% 2.52/1.86 # Non-unit clause-clause subsumptions : 8
% 2.52/1.86 # Unit Clause-clause subsumption calls : 285
% 2.52/1.86 # Rewrite failures with RHS unbound : 0
% 2.52/1.86 # BW rewrite match attempts : 0
% 2.52/1.86 # BW rewrite match successes : 0
% 2.52/1.86 # Condensation attempts : 0
% 2.52/1.86 # Condensation successes : 0
% 2.52/1.86 # Termbank termtop insertions : 73102
% 2.52/1.86 # Search garbage collected termcells : 40725
% 2.52/1.86
% 2.52/1.86 # -------------------------------------------------
% 2.52/1.86 # User time : 0.133 s
% 2.52/1.86 # System time : 0.081 s
% 2.52/1.86 # Total time : 0.214 s
% 2.52/1.86 # Maximum resident set size: 47968 pages
% 2.52/1.86
% 2.52/1.86 # -------------------------------------------------
% 2.52/1.86 # User time : 0.588 s
% 2.52/1.86 # System time : 0.178 s
% 2.52/1.86 # Total time : 0.765 s
% 2.52/1.86 # Maximum resident set size: 10784 pages
% 2.52/1.86 % E---3.1 exiting
%------------------------------------------------------------------------------