TSTP Solution File: CSR115+75 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR115+75 : TPTP v8.2.0. 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 : Mon May 20 19:20:12 EDT 2024
% Result : Theorem 0.46s 0.81s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 6 unt; 0 def)
% Number of atoms : 240 ( 0 equ)
% Maximal formula atoms : 104 ( 8 avg)
% Number of connectives : 297 ( 84 ~; 72 |; 139 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 104 ( 10 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 23 ( 22 usr; 1 prp; 0-4 aty)
% Number of functors : 49 ( 49 usr; 44 con; 0-3 aty)
% Number of variables : 87 ( 32 sgn 17 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_007_mira_wp_485,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/benchmark/theBenchmark.p',synth_qa07_007_mira_wp_485) ).
fof(ave07_era5_synth_qa07_007_mira_wp_485,hypothesis,
( tupl_p4(c269,c62,c69,c72)
& pred(c62,beid_2_1)
& pred(c69,l6_1_1)
& propr(c69,gleich_1_1)
& pred(c72,motor__1_1)
& attch(c85,c72)
& attr(c85,c86)
& sub(c85,firma_1_1)
& sub(c86,name_1_1)
& val(c86,bmw_0)
& sort(c269,ent)
& card(c269,card_c)
& etype(c269,etype_c)
& fact(c269,real)
& gener(c269,gener_c)
& quant(c269,quant_c)
& refer(c269,refer_c)
& varia(c269,varia_c)
& sort(c62,o)
& card(c62,int2)
& etype(c62,int1)
& etype(c62,int2)
& etype(c62,int3)
& fact(c62,real)
& gener(c62,gener_c)
& quant(c62,both)
& refer(c62,refer_c)
& varia(c62,varia_c)
& sort(c69,o)
& card(c69,cons(x_constant,cons(int1,nil)))
& etype(c69,int1)
& fact(c69,real)
& gener(c69,gener_c)
& quant(c69,mult)
& refer(c69,refer_c)
& varia(c69,varia_c)
& sort(c72,d)
& card(c72,cons(x_constant,cons(int1,nil)))
& etype(c72,int1)
& fact(c72,real)
& gener(c72,sp)
& quant(c72,mult)
& refer(c72,indet)
& varia(c72,varia_c)
& sort(beid_2_1,o)
& card(beid_2_1,int2)
& etype(beid_2_1,int1)
& fact(beid_2_1,real)
& gener(beid_2_1,gener_c)
& quant(beid_2_1,both)
& refer(beid_2_1,refer_c)
& varia(beid_2_1,varia_c)
& sort(l6_1_1,o)
& card(l6_1_1,int1)
& etype(l6_1_1,int0)
& fact(l6_1_1,real)
& gener(l6_1_1,ge)
& quant(l6_1_1,one)
& refer(l6_1_1,refer_c)
& varia(l6_1_1,varia_c)
& sort(gleich_1_1,rq)
& sort(motor__1_1,d)
& card(motor__1_1,int1)
& etype(motor__1_1,int0)
& fact(motor__1_1,real)
& gener(motor__1_1,ge)
& quant(motor__1_1,one)
& refer(motor__1_1,refer_c)
& varia(motor__1_1,varia_c)
& sort(c85,d)
& sort(c85,io)
& card(c85,int1)
& etype(c85,int0)
& fact(c85,real)
& gener(c85,sp)
& quant(c85,one)
& refer(c85,det)
& varia(c85,con)
& sort(c86,na)
& card(c86,int1)
& etype(c86,int0)
& fact(c86,real)
& gener(c86,sp)
& quant(c86,one)
& refer(c86,indet)
& varia(c86,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/benchmark/theBenchmark.p',ave07_era5_synth_qa07_007_mira_wp_485) ).
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/benchmark/Axioms/CSR004+0.ax',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/benchmark/Axioms/CSR004+0.ax',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_485]) ).
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(c86,bmw_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_485]) ).
cnf(c_0_8,hypothesis,
sub(c86,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_485]) ).
cnf(c_0_9,hypothesis,
( ~ val(X1,bmw_0)
| ~ attr(X2,c86)
| ~ 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,c86)
| ~ attr(X2,c86)
| ~ 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(c85,c86),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_485]) ).
cnf(c_0_12,hypothesis,
( ~ attr(X1,c86)
| ~ 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(c85,firma_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_485]) ).
fof(c_0_14,plain,
! [X330,X331,X332] :
( ( arg1(esk44_3(X330,X331,X332),X331)
| ~ arg1(X330,X331)
| ~ arg2(X330,X332)
| ~ subr(X330,sub_0) )
& ( arg2(esk44_3(X330,X331,X332),esk45_3(X330,X331,X332))
| ~ arg1(X330,X331)
| ~ arg2(X330,X332)
| ~ subr(X330,sub_0) )
& ( hsit(X330,esk43_3(X330,X331,X332))
| ~ arg1(X330,X331)
| ~ arg2(X330,X332)
| ~ subr(X330,sub_0) )
& ( mcont(esk43_3(X330,X331,X332),esk44_3(X330,X331,X332))
| ~ arg1(X330,X331)
| ~ arg2(X330,X332)
| ~ subr(X330,sub_0) )
& ( obj(esk43_3(X330,X331,X332),X331)
| ~ arg1(X330,X331)
| ~ arg2(X330,X332)
| ~ subr(X330,sub_0) )
& ( sub(esk45_3(X330,X331,X332),X332)
| ~ arg1(X330,X331)
| ~ arg2(X330,X332)
| ~ subr(X330,sub_0) )
& ( subr(esk44_3(X330,X331,X332),rprs_0)
| ~ arg1(X330,X331)
| ~ arg2(X330,X332)
| ~ subr(X330,sub_0) )
& ( subs(esk43_3(X330,X331,X332),bezeichnen_1_1)
| ~ arg1(X330,X331)
| ~ arg2(X330,X332)
| ~ subr(X330,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,c85) ),
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(esk43_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,
! [X336,X337] :
( ( arg1(esk46_2(X336,X337),X336)
| ~ sub(X336,X337) )
& ( arg2(esk46_2(X336,X337),X337)
| ~ sub(X336,X337) )
& ( subr(esk46_2(X336,X337),sub_0)
| ~ sub(X336,X337) ) ),
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,c85) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( subr(esk46_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(esk46_2(X3,X4),X5)
| ~ arg1(esk46_2(X3,X4),c85)
| ~ sub(X3,X4) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
( arg1(esk46_2(X1,X2),X1)
| ~ sub(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,hypothesis,
( ~ attr(X1,X2)
| ~ arg2(esk46_2(c85,X3),X4)
| ~ sub(c85,X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
( arg2(esk46_2(X1,X2),X2)
| ~ sub(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,hypothesis,
( ~ attr(X1,X2)
| ~ sub(c85,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.04/0.14 % Problem : CSR115+75 : TPTP v8.2.0. Released v4.0.0.
% 0.14/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n005.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sun May 19 02:01:53 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.23/0.52 Running first-order model finding
% 0.23/0.52 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.46/0.81 # Version: 3.1.0
% 0.46/0.81 # Preprocessing class: FMLLSMSLSSSNFFN.
% 0.46/0.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.81 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.46/0.81 # Starting new_bool_3 with 300s (1) cores
% 0.46/0.81 # Starting new_bool_1 with 300s (1) cores
% 0.46/0.81 # Starting sh5l with 300s (1) cores
% 0.46/0.81 # sh5l with pid 8689 completed with status 0
% 0.46/0.81 # Result found by sh5l
% 0.46/0.81 # Preprocessing class: FMLLSMSLSSSNFFN.
% 0.46/0.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.81 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.46/0.81 # Starting new_bool_3 with 300s (1) cores
% 0.46/0.81 # Starting new_bool_1 with 300s (1) cores
% 0.46/0.81 # Starting sh5l with 300s (1) cores
% 0.46/0.81 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.46/0.81 # Search class: FHHNS-FSLM32-MFFFFFNN
% 0.46/0.81 # partial match(2): FHHNS-SMLM32-MFFFFFNN
% 0.46/0.81 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.46/0.81 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.46/0.81 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 8690 completed with status 0
% 0.46/0.81 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.46/0.81 # Preprocessing class: FMLLSMSLSSSNFFN.
% 0.46/0.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.81 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.46/0.81 # Starting new_bool_3 with 300s (1) cores
% 0.46/0.81 # Starting new_bool_1 with 300s (1) cores
% 0.46/0.81 # Starting sh5l with 300s (1) cores
% 0.46/0.81 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.46/0.81 # Search class: FHHNS-FSLM32-MFFFFFNN
% 0.46/0.81 # partial match(2): FHHNS-SMLM32-MFFFFFNN
% 0.46/0.81 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.46/0.81 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.46/0.81 # Preprocessing time : 0.011 s
% 0.46/0.81 # Presaturation interreduction done
% 0.46/0.81
% 0.46/0.81 # Proof found!
% 0.46/0.81 # SZS status Theorem
% 0.46/0.81 # SZS output start CNFRefutation
% See solution above
% 0.46/0.81 # Parsed axioms : 10189
% 0.46/0.81 # Removed by relevancy pruning/SinE : 9967
% 0.46/0.81 # Initial clauses : 469
% 0.46/0.81 # Removed in clause preprocessing : 0
% 0.46/0.81 # Initial clauses in saturation : 469
% 0.46/0.81 # Processed clauses : 947
% 0.46/0.81 # ...of these trivial : 2
% 0.46/0.81 # ...subsumed : 1
% 0.46/0.81 # ...remaining for further processing : 944
% 0.46/0.81 # Other redundant clauses eliminated : 0
% 0.46/0.81 # Clauses deleted for lack of memory : 0
% 0.46/0.81 # Backward-subsumed : 19
% 0.46/0.81 # Backward-rewritten : 0
% 0.46/0.81 # Generated clauses : 396
% 0.46/0.81 # ...of the previous two non-redundant : 395
% 0.46/0.81 # ...aggressively subsumed : 0
% 0.46/0.81 # Contextual simplify-reflections : 2
% 0.46/0.81 # Paramodulations : 395
% 0.46/0.81 # Factorizations : 0
% 0.46/0.81 # NegExts : 0
% 0.46/0.81 # Equation resolutions : 0
% 0.46/0.81 # Disequality decompositions : 0
% 0.46/0.81 # Total rewrite steps : 6
% 0.46/0.81 # ...of those cached : 2
% 0.46/0.81 # Propositional unsat checks : 0
% 0.46/0.81 # Propositional check models : 0
% 0.46/0.81 # Propositional check unsatisfiable : 0
% 0.46/0.81 # Propositional clauses : 0
% 0.46/0.81 # Propositional clauses after purity: 0
% 0.46/0.81 # Propositional unsat core size : 0
% 0.46/0.81 # Propositional preprocessing time : 0.000
% 0.46/0.81 # Propositional encoding time : 0.000
% 0.46/0.81 # Propositional solver time : 0.000
% 0.46/0.81 # Success case prop preproc time : 0.000
% 0.46/0.81 # Success case prop encoding time : 0.000
% 0.46/0.81 # Success case prop solver time : 0.000
% 0.46/0.81 # Current number of processed clauses : 455
% 0.46/0.81 # Positive orientable unit clauses : 261
% 0.46/0.81 # Positive unorientable unit clauses: 0
% 0.46/0.81 # Negative unit clauses : 1
% 0.46/0.81 # Non-unit-clauses : 193
% 0.46/0.81 # Current number of unprocessed clauses: 386
% 0.46/0.81 # ...number of literals in the above : 1341
% 0.46/0.81 # Current number of archived formulas : 0
% 0.46/0.81 # Current number of archived clauses : 489
% 0.46/0.81 # Clause-clause subsumption calls (NU) : 30304
% 0.46/0.81 # Rec. Clause-clause subsumption calls : 12833
% 0.46/0.81 # Non-unit clause-clause subsumptions : 9
% 0.46/0.81 # Unit Clause-clause subsumption calls : 93
% 0.46/0.81 # Rewrite failures with RHS unbound : 0
% 0.46/0.81 # BW rewrite match attempts : 0
% 0.46/0.81 # BW rewrite match successes : 0
% 0.46/0.81 # Condensation attempts : 0
% 0.46/0.81 # Condensation successes : 0
% 0.46/0.81 # Termbank termtop insertions : 71120
% 0.46/0.81 # Search garbage collected termcells : 40671
% 0.46/0.81
% 0.46/0.81 # -------------------------------------------------
% 0.46/0.81 # User time : 0.095 s
% 0.46/0.81 # System time : 0.054 s
% 0.46/0.81 # Total time : 0.149 s
% 0.46/0.81 # Maximum resident set size: 47728 pages
% 0.46/0.81
% 0.46/0.81 # -------------------------------------------------
% 0.46/0.81 # User time : 0.183 s
% 0.46/0.81 # System time : 0.064 s
% 0.46/0.81 # Total time : 0.247 s
% 0.46/0.81 # Maximum resident set size: 10628 pages
% 0.46/0.81 % E---3.1 exiting
%------------------------------------------------------------------------------