TSTP Solution File: CSR115+66 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR115+66 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:10 EDT 2024
% Result : Theorem 0.88s 0.75s
% Output : CNFRefutation 0.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 14 unt; 0 def)
% Number of atoms : 209 ( 0 equ)
% Maximal formula atoms : 127 ( 8 avg)
% Number of connectives : 228 ( 44 ~; 37 |; 146 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 127 ( 10 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 19 ( 18 usr; 1 prp; 0-2 aty)
% Number of functors : 45 ( 45 usr; 45 con; 0-0 aty)
% Number of variables : 45 ( 5 sgn 11 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_007_mira_wp_475_a19984,conjecture,
? [X1,X2,X3,X4,X5,X6,X7] :
( agt(X4,X3)
& attr(X3,X2)
& attr(X5,X6)
& has_card_leq(X7,int1994)
& sub(X1,firma_1_1)
& sub(X2,name_1_1)
& sub(X6,jahr__1_1)
& subs(X4,n374bernehmen_1_1)
& temp(X4,X5)
& val(X2,bmw_0)
& val(X6,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',synth_qa07_007_mira_wp_475_a19984) ).
fof(ave07_era5_synth_qa07_007_mira_wp_475_a19984,hypothesis,
( assoc(autobauer_1_1,automobil_1_1)
& sub(autobauer_1_1,fabrikant_1_1)
& attr(c103,c104)
& prop(c103,britisch__1_1)
& sub(c103,autobauer_1_1)
& sub(c104,name_1_1)
& val(c104,rover_0)
& agt(c3,c86)
& obj(c3,c103)
& subs(c3,n374bernehmen_1_1)
& temp(c3,c4)
& attr(c4,c5)
& sub(c5,jahr__1_1)
& val(c5,c1)
& attr(c86,c87)
& sub(c86,firma_1_1)
& sub(c87,name_1_1)
& val(c87,bmw_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(automobil_1_1,tq)
& 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(c103,d)
& sort(c103,io)
& card(c103,int1)
& etype(c103,int0)
& fact(c103,real)
& gener(c103,sp)
& quant(c103,one)
& refer(c103,det)
& varia(c103,con)
& sort(c104,na)
& card(c104,int1)
& etype(c104,int0)
& fact(c104,real)
& gener(c104,sp)
& quant(c104,one)
& refer(c104,indet)
& varia(c104,varia_c)
& sort(britisch__1_1,nq)
& 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(rover_0,fe)
& sort(c3,da)
& fact(c3,real)
& gener(c3,sp)
& sort(c86,d)
& sort(c86,io)
& card(c86,int1)
& etype(c86,int0)
& fact(c86,real)
& gener(c86,sp)
& quant(c86,one)
& refer(c86,det)
& varia(c86,con)
& sort(n374bernehmen_1_1,da)
& fact(n374bernehmen_1_1,real)
& gener(n374bernehmen_1_1,ge)
& sort(c4,t)
& card(c4,int1)
& etype(c4,int0)
& fact(c4,real)
& gener(c4,sp)
& quant(c4,one)
& refer(c4,det)
& varia(c4,con)
& sort(c5,me)
& sort(c5,oa)
& sort(c5,ta)
& card(c5,card_c)
& etype(c5,etype_c)
& fact(c5,real)
& gener(c5,sp)
& quant(c5,quant_c)
& refer(c5,refer_c)
& varia(c5,varia_c)
& sort(jahr__1_1,me)
& sort(jahr__1_1,oa)
& sort(jahr__1_1,ta)
& card(jahr__1_1,card_c)
& etype(jahr__1_1,etype_c)
& fact(jahr__1_1,real)
& gener(jahr__1_1,ge)
& quant(jahr__1_1,quant_c)
& refer(jahr__1_1,refer_c)
& varia(jahr__1_1,varia_c)
& sort(c1,nu)
& card(c1,int1994)
& sort(c87,na)
& card(c87,int1)
& etype(c87,int0)
& fact(c87,real)
& gener(c87,sp)
& quant(c87,one)
& refer(c87,indet)
& varia(c87,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(bmw_0,fe) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ave07_era5_synth_qa07_007_mira_wp_475_a19984) ).
fof(has_card_eq,axiom,
! [X1,X2] :
( card(X1,X2)
=> has_card_leq(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR004+0.ax',has_card_eq) ).
fof(c_0_3,negated_conjecture,
~ ? [X1,X2,X3,X4,X5,X6,X7] :
( agt(X4,X3)
& attr(X3,X2)
& attr(X5,X6)
& has_card_leq(X7,int1994)
& sub(X1,firma_1_1)
& sub(X2,name_1_1)
& sub(X6,jahr__1_1)
& subs(X4,n374bernehmen_1_1)
& temp(X4,X5)
& val(X2,bmw_0)
& val(X6,X7) ),
inference(assume_negation,[status(cth)],[synth_qa07_007_mira_wp_475_a19984]) ).
fof(c_0_4,negated_conjecture,
! [X8,X9,X10,X11,X12,X13,X14] :
( ~ agt(X11,X10)
| ~ attr(X10,X9)
| ~ attr(X12,X13)
| ~ has_card_leq(X14,int1994)
| ~ sub(X8,firma_1_1)
| ~ sub(X9,name_1_1)
| ~ sub(X13,jahr__1_1)
| ~ subs(X11,n374bernehmen_1_1)
| ~ temp(X11,X12)
| ~ val(X9,bmw_0)
| ~ val(X13,X14) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_5,negated_conjecture,
( ~ agt(X1,X2)
| ~ attr(X2,X3)
| ~ attr(X4,X5)
| ~ has_card_leq(X6,int1994)
| ~ sub(X7,firma_1_1)
| ~ sub(X3,name_1_1)
| ~ sub(X5,jahr__1_1)
| ~ subs(X1,n374bernehmen_1_1)
| ~ temp(X1,X4)
| ~ val(X3,bmw_0)
| ~ val(X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,hypothesis,
agt(c3,c86),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_475_a19984]) ).
cnf(c_0_7,hypothesis,
subs(c3,n374bernehmen_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_475_a19984]) ).
cnf(c_0_8,hypothesis,
( ~ val(X1,bmw_0)
| ~ val(X2,X3)
| ~ attr(c86,X1)
| ~ attr(X4,X2)
| ~ temp(c3,X4)
| ~ sub(X5,firma_1_1)
| ~ sub(X2,jahr__1_1)
| ~ sub(X1,name_1_1)
| ~ has_card_leq(X3,int1994) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).
cnf(c_0_9,hypothesis,
attr(c4,c5),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_475_a19984]) ).
cnf(c_0_10,hypothesis,
temp(c3,c4),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_475_a19984]) ).
cnf(c_0_11,hypothesis,
sub(c5,jahr__1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_475_a19984]) ).
fof(c_0_12,plain,
! [X41,X42] :
( ~ card(X41,X42)
| has_card_leq(X41,X42) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[has_card_eq])])]) ).
cnf(c_0_13,hypothesis,
( ~ val(X1,bmw_0)
| ~ val(c5,X2)
| ~ attr(c86,X1)
| ~ sub(X3,firma_1_1)
| ~ sub(X1,name_1_1)
| ~ has_card_leq(X2,int1994) ),
inference(cn,[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])]) ).
cnf(c_0_14,hypothesis,
attr(c86,c87),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_475_a19984]) ).
cnf(c_0_15,hypothesis,
val(c87,bmw_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_475_a19984]) ).
cnf(c_0_16,hypothesis,
sub(c87,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_475_a19984]) ).
cnf(c_0_17,plain,
( has_card_leq(X1,X2)
| ~ card(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,hypothesis,
card(c1,int1994),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_475_a19984]) ).
cnf(c_0_19,hypothesis,
( ~ val(c5,X1)
| ~ sub(X2,firma_1_1)
| ~ has_card_leq(X1,int1994) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_20,hypothesis,
has_card_leq(c1,int1994),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,hypothesis,
val(c5,c1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_475_a19984]) ).
cnf(c_0_22,hypothesis,
sub(c86,firma_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_wp_475_a19984]) ).
cnf(c_0_23,hypothesis,
~ sub(X1,firma_1_1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_24,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_22,c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR115+66 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n021.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 : Sun May 19 01:00:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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/benchmark/theBenchmark.p
% 0.88/0.75 # Version: 3.1.0
% 0.88/0.75 # Preprocessing class: FMLLSMSLSSSNFFN.
% 0.88/0.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.88/0.75 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.88/0.75 # Starting new_bool_3 with 300s (1) cores
% 0.88/0.75 # Starting new_bool_1 with 300s (1) cores
% 0.88/0.75 # Starting sh5l with 300s (1) cores
% 0.88/0.75 # new_bool_3 with pid 19299 completed with status 0
% 0.88/0.75 # Result found by new_bool_3
% 0.88/0.75 # Preprocessing class: FMLLSMSLSSSNFFN.
% 0.88/0.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.88/0.75 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.88/0.75 # Starting new_bool_3 with 300s (1) cores
% 0.88/0.75 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.88/0.75 # Search class: FHHNF-FFMM33-SFFFFFNN
% 0.88/0.75 # partial match(1): FGHNF-FFMM33-SFFFFFNN
% 0.88/0.75 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.88/0.75 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.88/0.75 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 19303 completed with status 0
% 0.88/0.75 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.88/0.75 # Preprocessing class: FMLLSMSLSSSNFFN.
% 0.88/0.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.88/0.75 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.88/0.75 # Starting new_bool_3 with 300s (1) cores
% 0.88/0.75 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.88/0.75 # Search class: FHHNF-FFMM33-SFFFFFNN
% 0.88/0.75 # partial match(1): FGHNF-FFMM33-SFFFFFNN
% 0.88/0.75 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.88/0.75 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.88/0.75 # Preprocessing time : 0.014 s
% 0.88/0.75 # Presaturation interreduction done
% 0.88/0.75
% 0.88/0.75 # Proof found!
% 0.88/0.75 # SZS status Theorem
% 0.88/0.75 # SZS output start CNFRefutation
% See solution above
% 0.88/0.75 # Parsed axioms : 10189
% 0.88/0.75 # Removed by relevancy pruning/SinE : 10116
% 0.88/0.75 # Initial clauses : 209
% 0.88/0.75 # Removed in clause preprocessing : 0
% 0.88/0.75 # Initial clauses in saturation : 209
% 0.88/0.75 # Processed clauses : 462
% 0.88/0.75 # ...of these trivial : 2
% 0.88/0.75 # ...subsumed : 0
% 0.88/0.75 # ...remaining for further processing : 460
% 0.88/0.75 # Other redundant clauses eliminated : 0
% 0.88/0.75 # Clauses deleted for lack of memory : 0
% 0.88/0.75 # Backward-subsumed : 4
% 0.88/0.75 # Backward-rewritten : 0
% 0.88/0.75 # Generated clauses : 192
% 0.88/0.75 # ...of the previous two non-redundant : 191
% 0.88/0.75 # ...aggressively subsumed : 0
% 0.88/0.75 # Contextual simplify-reflections : 0
% 0.88/0.75 # Paramodulations : 191
% 0.88/0.75 # Factorizations : 0
% 0.88/0.75 # NegExts : 0
% 0.88/0.75 # Equation resolutions : 0
% 0.88/0.75 # Disequality decompositions : 0
% 0.88/0.75 # Total rewrite steps : 10
% 0.88/0.75 # ...of those cached : 1
% 0.88/0.75 # Propositional unsat checks : 0
% 0.88/0.75 # Propositional check models : 0
% 0.88/0.75 # Propositional check unsatisfiable : 0
% 0.88/0.75 # Propositional clauses : 0
% 0.88/0.75 # Propositional clauses after purity: 0
% 0.88/0.75 # Propositional unsat core size : 0
% 0.88/0.75 # Propositional preprocessing time : 0.000
% 0.88/0.75 # Propositional encoding time : 0.000
% 0.88/0.75 # Propositional solver time : 0.000
% 0.88/0.75 # Success case prop preproc time : 0.000
% 0.88/0.75 # Success case prop encoding time : 0.000
% 0.88/0.75 # Success case prop solver time : 0.000
% 0.88/0.75 # Current number of processed clauses : 246
% 0.88/0.75 # Positive orientable unit clauses : 197
% 0.88/0.75 # Positive unorientable unit clauses: 0
% 0.88/0.75 # Negative unit clauses : 1
% 0.88/0.75 # Non-unit-clauses : 48
% 0.88/0.75 # Current number of unprocessed clauses: 147
% 0.88/0.75 # ...number of literals in the above : 255
% 0.88/0.75 # Current number of archived formulas : 0
% 0.88/0.75 # Current number of archived clauses : 214
% 0.88/0.75 # Clause-clause subsumption calls (NU) : 3194
% 0.88/0.75 # Rec. Clause-clause subsumption calls : 816
% 0.88/0.75 # Non-unit clause-clause subsumptions : 1
% 0.88/0.75 # Unit Clause-clause subsumption calls : 24
% 0.88/0.75 # Rewrite failures with RHS unbound : 0
% 0.88/0.75 # BW rewrite match attempts : 0
% 0.88/0.75 # BW rewrite match successes : 0
% 0.88/0.75 # Condensation attempts : 0
% 0.88/0.75 # Condensation successes : 0
% 0.88/0.75 # Termbank termtop insertions : 51856
% 0.88/0.75 # Search garbage collected termcells : 38993
% 0.88/0.75
% 0.88/0.75 # -------------------------------------------------
% 0.88/0.75 # User time : 0.072 s
% 0.88/0.75 # System time : 0.067 s
% 0.88/0.75 # Total time : 0.139 s
% 0.88/0.75 # Maximum resident set size: 42404 pages
% 0.88/0.75
% 0.88/0.75 # -------------------------------------------------
% 0.88/0.75 # User time : 0.158 s
% 0.88/0.75 # System time : 0.082 s
% 0.88/0.75 # Total time : 0.239 s
% 0.88/0.75 # Maximum resident set size: 10636 pages
% 0.88/0.75 % E---3.1 exiting
%------------------------------------------------------------------------------