TSTP Solution File: CSR114+13 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR114+13 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:15:53 EDT 2024
% Result : Theorem 1.48s 0.79s
% Output : CNFRefutation 1.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 10 unt; 0 def)
% Number of atoms : 233 ( 0 equ)
% Maximal formula atoms : 135 ( 8 avg)
% Number of connectives : 257 ( 52 ~; 42 |; 161 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 135 ( 9 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 21 ( 20 usr; 1 prp; 0-5 aty)
% Number of functors : 51 ( 51 usr; 46 con; 0-3 aty)
% Number of variables : 63 ( 14 sgn 15 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_004_mira_wp_311,conjecture,
? [X1,X2,X3,X4,X5] :
( attr(X1,X2)
& loc(X5,X3)
& scar(X5,X4)
& sub(X2,name_1_1)
& sub(X1,stadt__1_1)
& subs(X5,stehen_1_1)
& val(X2,rom_0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',synth_qa07_004_mira_wp_311) ).
fof(ave07_era5_synth_qa07_004_mira_wp_311,hypothesis,
( attr(c112,c113)
& sub(c112,gebietsinstitution_1_1)
& sub(c113,name_1_1)
& val(c113,ponza_0)
& prop(c117,beliebt_1_1)
& sub(c117,ferienziel_1_1)
& pred(c123,tourist_1_1)
& prop(c123,italienisch__1_1)
& attr(c136,c137)
& sub(c136,stadt__1_1)
& sub(c137,name_1_1)
& val(c137,rom_0)
& tupl_p5(c694,c112,c117,c123,c136)
& assoc(ferienziel_1_1,ferien__1_1)
& sub(ferienziel_1_1,ziel_1_1)
& sort(c112,d)
& sort(c112,io)
& card(c112,int1)
& etype(c112,int0)
& fact(c112,real)
& gener(c112,sp)
& quant(c112,one)
& refer(c112,det)
& varia(c112,con)
& sort(c113,na)
& card(c113,int1)
& etype(c113,int0)
& fact(c113,real)
& gener(c113,sp)
& quant(c113,one)
& refer(c113,indet)
& varia(c113,varia_c)
& sort(gebietsinstitution_1_1,d)
& sort(gebietsinstitution_1_1,io)
& card(gebietsinstitution_1_1,int1)
& etype(gebietsinstitution_1_1,int0)
& fact(gebietsinstitution_1_1,real)
& gener(gebietsinstitution_1_1,ge)
& quant(gebietsinstitution_1_1,one)
& refer(gebietsinstitution_1_1,refer_c)
& varia(gebietsinstitution_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(ponza_0,fe)
& sort(c117,io)
& card(c117,int1)
& etype(c117,int0)
& fact(c117,real)
& gener(c117,sp)
& quant(c117,one)
& refer(c117,indet)
& varia(c117,varia_c)
& sort(beliebt_1_1,nq)
& sort(ferienziel_1_1,io)
& card(ferienziel_1_1,int1)
& etype(ferienziel_1_1,int0)
& fact(ferienziel_1_1,real)
& gener(ferienziel_1_1,ge)
& quant(ferienziel_1_1,one)
& refer(ferienziel_1_1,refer_c)
& varia(ferienziel_1_1,varia_c)
& sort(c123,d)
& card(c123,cons(x_constant,cons(int1,nil)))
& etype(c123,int1)
& fact(c123,real)
& gener(c123,gener_c)
& quant(c123,mult)
& refer(c123,refer_c)
& varia(c123,varia_c)
& sort(tourist_1_1,d)
& card(tourist_1_1,int1)
& etype(tourist_1_1,int0)
& fact(tourist_1_1,real)
& gener(tourist_1_1,ge)
& quant(tourist_1_1,one)
& refer(tourist_1_1,refer_c)
& varia(tourist_1_1,varia_c)
& sort(italienisch__1_1,nq)
& sort(c136,d)
& sort(c136,io)
& card(c136,int1)
& etype(c136,int0)
& fact(c136,real)
& gener(c136,sp)
& quant(c136,one)
& refer(c136,det)
& varia(c136,con)
& sort(c137,na)
& card(c137,int1)
& etype(c137,int0)
& fact(c137,real)
& gener(c137,sp)
& quant(c137,one)
& refer(c137,indet)
& varia(c137,varia_c)
& sort(stadt__1_1,d)
& sort(stadt__1_1,io)
& card(stadt__1_1,int1)
& etype(stadt__1_1,int0)
& fact(stadt__1_1,real)
& gener(stadt__1_1,ge)
& quant(stadt__1_1,one)
& refer(stadt__1_1,refer_c)
& varia(stadt__1_1,varia_c)
& sort(rom_0,fe)
& sort(c694,ent)
& card(c694,card_c)
& etype(c694,etype_c)
& fact(c694,real)
& gener(c694,gener_c)
& quant(c694,quant_c)
& refer(c694,refer_c)
& varia(c694,varia_c)
& sort(ferien__1_1,as)
& card(ferien__1_1,int1)
& etype(ferien__1_1,int0)
& fact(ferien__1_1,real)
& gener(ferien__1_1,ge)
& quant(ferien__1_1,one)
& refer(ferien__1_1,refer_c)
& varia(ferien__1_1,varia_c)
& sort(ziel_1_1,io)
& card(ziel_1_1,int1)
& etype(ziel_1_1,int0)
& fact(ziel_1_1,real)
& gener(ziel_1_1,ge)
& quant(ziel_1_1,one)
& refer(ziel_1_1,refer_c)
& varia(ziel_1_1,varia_c) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ave07_era5_synth_qa07_004_mira_wp_311) ).
fof(loc__stehen_1_1_loc,axiom,
! [X1,X2] :
( loc(X1,X2)
=> ? [X3] :
( loc(X3,X2)
& scar(X3,X1)
& subs(X3,stehen_1_1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR004+0.ax',loc__stehen_1_1_loc) ).
fof(state_adjective__in_state,axiom,
! [X1,X2,X3] :
( ( prop(X1,X2)
& state_adjective_state_binding(X2,X3) )
=> ? [X4,X5,X6] :
( in(X6,X4)
& attr(X4,X5)
& loc(X1,X6)
& sub(X4,land_1_1)
& sub(X5,name_1_1)
& val(X5,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR004+0.ax',state_adjective__in_state) ).
fof(fact_8886,axiom,
state_adjective_state_binding(italienisch__1_1,italien_0),
file('/export/starexec/sandbox/benchmark/Axioms/CSR004+0.ax',fact_8886) ).
fof(c_0_5,negated_conjecture,
~ ? [X1,X2,X3,X4,X5] :
( attr(X1,X2)
& loc(X5,X3)
& scar(X5,X4)
& sub(X2,name_1_1)
& sub(X1,stadt__1_1)
& subs(X5,stehen_1_1)
& val(X2,rom_0) ),
inference(assume_negation,[status(cth)],[synth_qa07_004_mira_wp_311]) ).
fof(c_0_6,negated_conjecture,
! [X8,X9,X10,X11,X12] :
( ~ attr(X8,X9)
| ~ loc(X12,X10)
| ~ scar(X12,X11)
| ~ sub(X9,name_1_1)
| ~ sub(X8,stadt__1_1)
| ~ subs(X12,stehen_1_1)
| ~ val(X9,rom_0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_7,negated_conjecture,
( ~ attr(X1,X2)
| ~ loc(X3,X4)
| ~ scar(X3,X5)
| ~ sub(X2,name_1_1)
| ~ sub(X1,stadt__1_1)
| ~ subs(X3,stehen_1_1)
| ~ val(X2,rom_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_8,hypothesis,
val(c137,rom_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_mira_wp_311]) ).
cnf(c_0_9,hypothesis,
sub(c137,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_mira_wp_311]) ).
cnf(c_0_10,hypothesis,
( ~ attr(X1,c137)
| ~ scar(X2,X3)
| ~ loc(X2,X4)
| ~ subs(X2,stehen_1_1)
| ~ sub(X1,stadt__1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_11,hypothesis,
attr(c136,c137),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_mira_wp_311]) ).
cnf(c_0_12,hypothesis,
sub(c136,stadt__1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_mira_wp_311]) ).
fof(c_0_13,plain,
! [X54,X55] :
( ( loc(esk12_2(X54,X55),X55)
| ~ loc(X54,X55) )
& ( scar(esk12_2(X54,X55),X54)
| ~ loc(X54,X55) )
& ( subs(esk12_2(X54,X55),stehen_1_1)
| ~ loc(X54,X55) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[loc__stehen_1_1_loc])])])])]) ).
cnf(c_0_14,hypothesis,
( ~ scar(X1,X2)
| ~ loc(X1,X3)
| ~ subs(X1,stehen_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_15,plain,
( subs(esk12_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,hypothesis,
( ~ scar(esk12_2(X1,X2),X3)
| ~ loc(esk12_2(X1,X2),X4)
| ~ loc(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
( scar(esk12_2(X1,X2),X1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X37,X38,X39] :
( ( in(esk9_3(X37,X38,X39),esk7_3(X37,X38,X39))
| ~ prop(X37,X38)
| ~ state_adjective_state_binding(X38,X39) )
& ( attr(esk7_3(X37,X38,X39),esk8_3(X37,X38,X39))
| ~ prop(X37,X38)
| ~ state_adjective_state_binding(X38,X39) )
& ( loc(X37,esk9_3(X37,X38,X39))
| ~ prop(X37,X38)
| ~ state_adjective_state_binding(X38,X39) )
& ( sub(esk7_3(X37,X38,X39),land_1_1)
| ~ prop(X37,X38)
| ~ state_adjective_state_binding(X38,X39) )
& ( sub(esk8_3(X37,X38,X39),name_1_1)
| ~ prop(X37,X38)
| ~ state_adjective_state_binding(X38,X39) )
& ( val(esk8_3(X37,X38,X39),X39)
| ~ prop(X37,X38)
| ~ state_adjective_state_binding(X38,X39) ) ),
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)],[state_adjective__in_state])])])])])]) ).
cnf(c_0_19,hypothesis,
( ~ loc(esk12_2(X1,X2),X3)
| ~ loc(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( loc(esk12_2(X1,X2),X2)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( loc(X1,esk9_3(X1,X2,X3))
| ~ prop(X1,X2)
| ~ state_adjective_state_binding(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,hypothesis,
~ loc(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( ~ state_adjective_state_binding(X1,X2)
| ~ prop(X3,X1) ),
inference(sr,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
state_adjective_state_binding(italienisch__1_1,italien_0),
inference(split_conjunct,[status(thm)],[fact_8886]) ).
cnf(c_0_25,hypothesis,
prop(c123,italienisch__1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_mira_wp_311]) ).
cnf(c_0_26,plain,
~ prop(X1,italienisch__1_1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_25,c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : CSR114+13 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n004.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 : Sun May 19 01:36:41 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 1.48/0.79 # Version: 3.1.0
% 1.48/0.79 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.48/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.48/0.79 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.48/0.79 # Starting new_bool_3 with 300s (1) cores
% 1.48/0.79 # Starting new_bool_1 with 300s (1) cores
% 1.48/0.79 # Starting sh5l with 300s (1) cores
% 1.48/0.79 # sh5l with pid 9352 completed with status 0
% 1.48/0.79 # Result found by sh5l
% 1.48/0.79 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.48/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.48/0.79 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.48/0.79 # Starting new_bool_3 with 300s (1) cores
% 1.48/0.79 # Starting new_bool_1 with 300s (1) cores
% 1.48/0.79 # Starting sh5l with 300s (1) cores
% 1.48/0.79 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.48/0.79 # Search class: FHHNS-FSLM32-MFFFFFNN
% 1.48/0.79 # partial match(2): FHHNS-SMLM32-MFFFFFNN
% 1.48/0.79 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.48/0.79 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.48/0.79 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 9355 completed with status 0
% 1.48/0.79 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1.48/0.79 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.48/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.48/0.79 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.48/0.79 # Starting new_bool_3 with 300s (1) cores
% 1.48/0.79 # Starting new_bool_1 with 300s (1) cores
% 1.48/0.79 # Starting sh5l with 300s (1) cores
% 1.48/0.79 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.48/0.79 # Search class: FHHNS-FSLM32-MFFFFFNN
% 1.48/0.79 # partial match(2): FHHNS-SMLM32-MFFFFFNN
% 1.48/0.79 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.48/0.79 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.48/0.79 # Preprocessing time : 0.019 s
% 1.48/0.79 # Presaturation interreduction done
% 1.48/0.79
% 1.48/0.79 # Proof found!
% 1.48/0.79 # SZS status Theorem
% 1.48/0.79 # SZS output start CNFRefutation
% See solution above
% 1.48/0.79 # Parsed axioms : 10189
% 1.48/0.79 # Removed by relevancy pruning/SinE : 9952
% 1.48/0.79 # Initial clauses : 518
% 1.48/0.79 # Removed in clause preprocessing : 0
% 1.48/0.79 # Initial clauses in saturation : 518
% 1.48/0.79 # Processed clauses : 980
% 1.48/0.79 # ...of these trivial : 0
% 1.48/0.79 # ...subsumed : 6
% 1.48/0.79 # ...remaining for further processing : 974
% 1.48/0.79 # Other redundant clauses eliminated : 0
% 1.48/0.79 # Clauses deleted for lack of memory : 0
% 1.48/0.79 # Backward-subsumed : 47
% 1.48/0.79 # Backward-rewritten : 0
% 1.48/0.79 # Generated clauses : 284
% 1.48/0.79 # ...of the previous two non-redundant : 283
% 1.48/0.79 # ...aggressively subsumed : 0
% 1.48/0.79 # Contextual simplify-reflections : 0
% 1.48/0.79 # Paramodulations : 283
% 1.48/0.79 # Factorizations : 0
% 1.48/0.79 # NegExts : 0
% 1.48/0.79 # Equation resolutions : 0
% 1.48/0.79 # Disequality decompositions : 0
% 1.48/0.79 # Total rewrite steps : 2
% 1.48/0.79 # ...of those cached : 0
% 1.48/0.79 # Propositional unsat checks : 0
% 1.48/0.79 # Propositional check models : 0
% 1.48/0.79 # Propositional check unsatisfiable : 0
% 1.48/0.79 # Propositional clauses : 0
% 1.48/0.79 # Propositional clauses after purity: 0
% 1.48/0.79 # Propositional unsat core size : 0
% 1.48/0.79 # Propositional preprocessing time : 0.000
% 1.48/0.79 # Propositional encoding time : 0.000
% 1.48/0.79 # Propositional solver time : 0.000
% 1.48/0.79 # Success case prop preproc time : 0.000
% 1.48/0.79 # Success case prop encoding time : 0.000
% 1.48/0.79 # Success case prop solver time : 0.000
% 1.48/0.79 # Current number of processed clauses : 408
% 1.48/0.79 # Positive orientable unit clauses : 307
% 1.48/0.79 # Positive unorientable unit clauses: 0
% 1.48/0.79 # Negative unit clauses : 4
% 1.48/0.79 # Non-unit-clauses : 97
% 1.48/0.79 # Current number of unprocessed clauses: 332
% 1.48/0.79 # ...number of literals in the above : 1097
% 1.48/0.79 # Current number of archived formulas : 0
% 1.48/0.79 # Current number of archived clauses : 566
% 1.48/0.79 # Clause-clause subsumption calls (NU) : 24021
% 1.48/0.79 # Rec. Clause-clause subsumption calls : 11081
% 1.48/0.79 # Non-unit clause-clause subsumptions : 9
% 1.48/0.79 # Unit Clause-clause subsumption calls : 802
% 1.48/0.79 # Rewrite failures with RHS unbound : 0
% 1.48/0.79 # BW rewrite match attempts : 0
% 1.48/0.79 # BW rewrite match successes : 0
% 1.48/0.79 # Condensation attempts : 0
% 1.48/0.79 # Condensation successes : 0
% 1.48/0.79 # Termbank termtop insertions : 70276
% 1.48/0.79 # Search garbage collected termcells : 40689
% 1.48/0.79
% 1.48/0.79 # -------------------------------------------------
% 1.48/0.79 # User time : 0.109 s
% 1.48/0.79 # System time : 0.083 s
% 1.48/0.79 # Total time : 0.191 s
% 1.48/0.79 # Maximum resident set size: 47772 pages
% 1.48/0.79
% 1.48/0.79 # -------------------------------------------------
% 1.48/0.79 # User time : 0.195 s
% 1.48/0.79 # System time : 0.094 s
% 1.48/0.79 # Total time : 0.289 s
% 1.48/0.79 # Maximum resident set size: 10636 pages
% 1.48/0.79 % E---3.1 exiting
% 1.48/0.79 % E exiting
%------------------------------------------------------------------------------