TSTP Solution File: CSR113+15 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR113+15 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.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 : 600s
% DateTime : Fri Jul 15 03:02:56 EDT 2022
% Result : Theorem 1.42s 25.60s
% Output : CNFRefutation 1.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 8 unt; 0 def)
% Number of atoms : 239 ( 0 equ)
% Maximal formula atoms : 152 ( 8 avg)
% Number of connectives : 260 ( 50 ~; 39 |; 167 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 152 ( 10 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 28 ( 27 usr; 3 prp; 0-2 aty)
% Number of functors : 42 ( 42 usr; 41 con; 0-2 aty)
% Number of variables : 56 ( 8 sgn 18 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_003_mira_wp_203_a19713,conjecture,
? [X1,X2,X3,X4,X5] :
( flp(X1,X3)
& loc(X4,X1)
& scar(X4,X5)
& sub(X2,name_1_1)
& subs(X4,stehen_1_1)
& val(X2,new_york_0) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',synth_qa07_003_mira_wp_203_a19713) ).
fof(ave07_era5_synth_qa07_003_mira_wp_203_a19713,hypothesis,
( caus(c17,c43)
& sub(c17,gedanke_1_1)
& sub(c23,bootshafen_1_1)
& attch(c30,c23)
& attr(c30,c31)
& sub(c30,stadt__1_1)
& sub(c31,name_1_1)
& val(c31,new_york_0)
& sub(c32,freiheitsstatue_1_1)
& loc(c43,c79)
& rslt(c43,c32)
& subs(c43,errichten_1_1)
& agt(c75,c55)
& modl(c75,nicht_1_1)
& semrel(c75,c43)
& subs(c75,kommen_1_1)
& in(c79,c23)
& assoc(freiheitsstatue_1_1,freiheit_1_1)
& sub(freiheitsstatue_1_1,statue_1_1)
& sort(c17,as)
& sort(c17,io)
& card(c17,int1)
& etype(c17,int0)
& fact(c17,real)
& gener(c17,sp)
& quant(c17,one)
& refer(c17,det)
& varia(c17,con)
& sort(c43,da)
& fact(c43,real)
& gener(c43,sp)
& sort(gedanke_1_1,as)
& sort(gedanke_1_1,io)
& card(gedanke_1_1,int1)
& etype(gedanke_1_1,int0)
& fact(gedanke_1_1,real)
& gener(gedanke_1_1,ge)
& quant(gedanke_1_1,one)
& refer(gedanke_1_1,refer_c)
& varia(gedanke_1_1,varia_c)
& sort(c23,d)
& card(c23,int1)
& etype(c23,int0)
& fact(c23,real)
& gener(c23,sp)
& quant(c23,one)
& refer(c23,det)
& varia(c23,con)
& sort(bootshafen_1_1,d)
& card(bootshafen_1_1,int1)
& etype(bootshafen_1_1,int0)
& fact(bootshafen_1_1,real)
& gener(bootshafen_1_1,ge)
& quant(bootshafen_1_1,one)
& refer(bootshafen_1_1,refer_c)
& varia(bootshafen_1_1,varia_c)
& sort(c30,d)
& sort(c30,io)
& card(c30,int1)
& etype(c30,int0)
& fact(c30,real)
& gener(c30,sp)
& quant(c30,one)
& refer(c30,det)
& varia(c30,con)
& sort(c31,na)
& card(c31,int1)
& etype(c31,int0)
& fact(c31,real)
& gener(c31,sp)
& quant(c31,one)
& refer(c31,indet)
& varia(c31,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(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(new_york_0,fe)
& sort(c32,d)
& card(c32,int1)
& etype(c32,int0)
& fact(c32,real)
& gener(c32,sp)
& quant(c32,one)
& refer(c32,indet)
& varia(c32,varia_c)
& sort(freiheitsstatue_1_1,d)
& card(freiheitsstatue_1_1,int1)
& etype(freiheitsstatue_1_1,int0)
& fact(freiheitsstatue_1_1,real)
& gener(freiheitsstatue_1_1,ge)
& quant(freiheitsstatue_1_1,one)
& refer(freiheitsstatue_1_1,refer_c)
& varia(freiheitsstatue_1_1,varia_c)
& sort(c79,l)
& card(c79,int1)
& etype(c79,int0)
& fact(c79,real)
& gener(c79,sp)
& quant(c79,one)
& refer(c79,det)
& varia(c79,con)
& sort(errichten_1_1,da)
& fact(errichten_1_1,real)
& gener(errichten_1_1,ge)
& sort(c75,da)
& fact(c75,real)
& gener(c75,sp)
& sort(c55,d)
& card(c55,int1)
& etype(c55,int0)
& fact(c55,real)
& gener(c55,sp)
& quant(c55,one)
& refer(c55,det)
& varia(c55,varia_c)
& sort(nicht_1_1,md)
& fact(nicht_1_1,real)
& gener(nicht_1_1,gener_c)
& sort(kommen_1_1,da)
& fact(kommen_1_1,real)
& gener(kommen_1_1,ge)
& sort(freiheit_1_1,as)
& sort(freiheit_1_1,io)
& card(freiheit_1_1,int1)
& etype(freiheit_1_1,int0)
& fact(freiheit_1_1,real)
& gener(freiheit_1_1,ge)
& quant(freiheit_1_1,one)
& refer(freiheit_1_1,refer_c)
& varia(freiheit_1_1,varia_c)
& sort(statue_1_1,d)
& card(statue_1_1,int1)
& etype(statue_1_1,int0)
& fact(statue_1_1,real)
& gener(statue_1_1,ge)
& quant(statue_1_1,one)
& refer(statue_1_1,refer_c)
& varia(statue_1_1,varia_c) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ave07_era5_synth_qa07_003_mira_wp_203_a19713) ).
fof(local_function___flp,axiom,
! [X1,X2] :
( ( in(X1,X2)
| an(X1,X2)
| bei(X1,X2) )
=> flp(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR004+0.ax',local_function___flp) ).
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(c_0_4,negated_conjecture,
~ ? [X1,X2,X3,X4,X5] :
( flp(X1,X3)
& loc(X4,X1)
& scar(X4,X5)
& sub(X2,name_1_1)
& subs(X4,stehen_1_1)
& val(X2,new_york_0) ),
inference(assume_negation,[status(cth)],[synth_qa07_003_mira_wp_203_a19713]) ).
fof(c_0_5,negated_conjecture,
! [X6,X7,X8,X9,X10] :
( ~ flp(X6,X8)
| ~ loc(X9,X6)
| ~ scar(X9,X10)
| ~ sub(X7,name_1_1)
| ~ subs(X9,stehen_1_1)
| ~ val(X7,new_york_0) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_6,plain,
( ~ epred1_0
<=> ! [X1] :
( ~ sub(X1,name_1_1)
| ~ val(X1,new_york_0) ) ),
introduced(definition) ).
fof(c_0_7,plain,
( ~ epred2_0
<=> ! [X2,X3,X5,X4] :
( ~ subs(X2,stehen_1_1)
| ~ loc(X2,X4)
| ~ scar(X2,X3)
| ~ flp(X4,X5) ) ),
introduced(definition) ).
cnf(c_0_8,negated_conjecture,
( ~ val(X1,new_york_0)
| ~ subs(X2,stehen_1_1)
| ~ sub(X1,name_1_1)
| ~ scar(X2,X3)
| ~ loc(X2,X4)
| ~ flp(X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( epred1_0
| ~ val(X1,new_york_0)
| ~ sub(X1,name_1_1) ),
inference(split_equiv,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
val(c31,new_york_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mira_wp_203_a19713]) ).
cnf(c_0_11,hypothesis,
sub(c31,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mira_wp_203_a19713]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ( ~ in(X3,X4)
| flp(X3,X4) )
& ( ~ an(X3,X4)
| flp(X3,X4) )
& ( ~ bei(X3,X4)
| flp(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[local_function___flp])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_8,c_0_6]),c_0_7]) ).
cnf(c_0_14,hypothesis,
epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_15,negated_conjecture,
( epred2_0
| ~ flp(X1,X2)
| ~ scar(X3,X4)
| ~ loc(X3,X1)
| ~ subs(X3,stehen_1_1) ),
inference(split_equiv,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
( flp(X1,X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
~ epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_18,negated_conjecture,
( ~ in(X1,X2)
| ~ scar(X3,X4)
| ~ loc(X3,X1)
| ~ subs(X3,stehen_1_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_19,hypothesis,
in(c79,c23),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mira_wp_203_a19713]) ).
fof(c_0_20,plain,
! [X4,X5] :
( ( loc(esk3_2(X4,X5),X5)
| ~ loc(X4,X5) )
& ( scar(esk3_2(X4,X5),X4)
| ~ loc(X4,X5) )
& ( subs(esk3_2(X4,X5),stehen_1_1)
| ~ loc(X4,X5) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[loc__stehen_1_1_loc])])])])])]) ).
cnf(c_0_21,hypothesis,
( ~ scar(X1,X2)
| ~ loc(X1,c79)
| ~ subs(X1,stehen_1_1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( scar(esk3_2(X1,X2),X1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,plain,
( subs(esk3_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,hypothesis,
( ~ loc(esk3_2(X1,X2),c79)
| ~ loc(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_25,plain,
( loc(esk3_2(X1,X2),X2)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,hypothesis,
loc(c43,c79),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mira_wp_203_a19713]) ).
cnf(c_0_27,hypothesis,
~ loc(X1,c79),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_26,c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : CSR113+15 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 22:06:18 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.42/24.46 eprover: CPU time limit exceeded, terminating
% 1.42/24.47 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 1.42/24.47
% 1.42/24.63 eprover: CPU time limit exceeded, terminating
% 1.42/25.60 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 1.42/25.60
% 1.42/25.60 # Failure: Resource limit exceeded (time)
% 1.42/25.60 # OLD status Res
% 1.42/25.60 # Preprocessing time : 0.219 s
% 1.42/25.60 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 1.42/25.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 1.42/25.60 # Preprocessing time : 0.151 s
% 1.42/25.60
% 1.42/25.60 # Proof found!
% 1.42/25.60 # SZS status Theorem
% 1.42/25.60 # SZS output start CNFRefutation
% See solution above
% 1.42/25.60 # Proof object total steps : 29
% 1.42/25.60 # Proof object clause steps : 19
% 1.42/25.60 # Proof object formula steps : 10
% 1.42/25.60 # Proof object conjectures : 9
% 1.42/25.60 # Proof object clause conjectures : 6
% 1.42/25.60 # Proof object formula conjectures : 3
% 1.42/25.60 # Proof object initial clauses used : 11
% 1.42/25.60 # Proof object initial formulas used : 4
% 1.42/25.60 # Proof object generating inferences : 5
% 1.42/25.60 # Proof object simplifying inferences : 9
% 1.42/25.60 # Training examples: 0 positive, 0 negative
% 1.42/25.60 # Parsed axioms : 10189
% 1.42/25.60 # Removed by relevancy pruning/SinE : 10126
% 1.42/25.60 # Initial clauses : 243
% 1.42/25.60 # Removed in clause preprocessing : 0
% 1.42/25.60 # Initial clauses in saturation : 243
% 1.42/25.60 # Processed clauses : 269
% 1.42/25.60 # ...of these trivial : 2
% 1.42/25.60 # ...subsumed : 0
% 1.42/25.60 # ...remaining for further processing : 267
% 1.42/25.60 # Other redundant clauses eliminated : 0
% 1.42/25.60 # Clauses deleted for lack of memory : 0
% 1.42/25.60 # Backward-subsumed : 0
% 1.42/25.60 # Backward-rewritten : 2
% 1.42/25.60 # Generated clauses : 95
% 1.42/25.60 # ...of the previous two non-trivial : 94
% 1.42/25.60 # Contextual simplify-reflections : 1
% 1.42/25.60 # Paramodulations : 91
% 1.42/25.60 # Factorizations : 0
% 1.42/25.60 # Equation resolutions : 0
% 1.42/25.60 # Current number of processed clauses : 263
% 1.42/25.60 # Positive orientable unit clauses : 175
% 1.42/25.60 # Positive unorientable unit clauses: 0
% 1.42/25.60 # Negative unit clauses : 2
% 1.42/25.60 # Non-unit-clauses : 86
% 1.42/25.60 # Current number of unprocessed clauses: 66
% 1.42/25.60 # ...number of literals in the above : 249
% 1.42/25.60 # Current number of archived formulas : 0
% 1.42/25.60 # Current number of archived clauses : 3
% 1.42/25.60 # Clause-clause subsumption calls (NU) : 1675
% 1.42/25.60 # Rec. Clause-clause subsumption calls : 826
% 1.42/25.60 # Non-unit clause-clause subsumptions : 1
% 1.42/25.60 # Unit Clause-clause subsumption calls : 216
% 1.42/25.60 # Rewrite failures with RHS unbound : 0
% 1.42/25.60 # BW rewrite match attempts : 1
% 1.42/25.60 # BW rewrite match successes : 1
% 1.42/25.60 # Condensation attempts : 0
% 1.42/25.60 # Condensation successes : 0
% 1.42/25.60 # Termbank termtop insertions : 51582
% 1.42/25.60
% 1.42/25.60 # -------------------------------------------------
% 1.42/25.60 # User time : 0.126 s
% 1.42/25.60 # System time : 0.034 s
% 1.42/25.60 # Total time : 0.160 s
% 1.42/25.60 # Maximum resident set size: 46660 pages
%------------------------------------------------------------------------------