TSTP Solution File: CSR113+15 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR113+15 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:33:45 EDT 2024
% Result : Theorem 2.36s 2.74s
% Output : CNFRefutation 2.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 10 unt; 0 def)
% Number of atoms : 223 ( 0 equ)
% Maximal formula atoms : 152 ( 8 avg)
% Number of connectives : 230 ( 33 ~; 28 |; 167 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 152 ( 10 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 26 ( 25 usr; 1 prp; 0-2 aty)
% Number of functors : 42 ( 42 usr; 41 con; 0-2 aty)
% Number of variables : 47 ( 8 sgn 13 !; 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/sandbox2/tmp/tmp.3OyY13d6TP/E---3.1_28097.p',synth_qa07_003_mira_wp_203_a19713) ).
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/sandbox2/tmp/tmp.3OyY13d6TP/E---3.1_28097.p',loc__stehen_1_1_loc) ).
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/sandbox2/tmp/tmp.3OyY13d6TP/E---3.1_28097.p',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/sandbox2/tmp/tmp.3OyY13d6TP/E---3.1_28097.p',local_function___flp) ).
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,
! [X8,X9,X10,X11,X12] :
( ~ flp(X8,X10)
| ~ loc(X11,X8)
| ~ scar(X11,X12)
| ~ sub(X9,name_1_1)
| ~ subs(X11,stehen_1_1)
| ~ val(X9,new_york_0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X24,X25] :
( ( loc(esk3_2(X24,X25),X25)
| ~ loc(X24,X25) )
& ( scar(esk3_2(X24,X25),X24)
| ~ loc(X24,X25) )
& ( subs(esk3_2(X24,X25),stehen_1_1)
| ~ loc(X24,X25) ) ),
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_7,negated_conjecture,
( ~ flp(X1,X2)
| ~ loc(X3,X1)
| ~ scar(X3,X4)
| ~ sub(X5,name_1_1)
| ~ subs(X3,stehen_1_1)
| ~ val(X5,new_york_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,hypothesis,
val(c31,new_york_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mira_wp_203_a19713]) ).
cnf(c_0_9,hypothesis,
sub(c31,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mira_wp_203_a19713]) ).
cnf(c_0_10,plain,
( subs(esk3_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
loc(c43,c79),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mira_wp_203_a19713]) ).
cnf(c_0_12,hypothesis,
( ~ flp(X1,X2)
| ~ scar(X3,X4)
| ~ loc(X3,X1)
| ~ subs(X3,stehen_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_13,hypothesis,
subs(esk3_2(c43,c79),stehen_1_1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( scar(esk3_2(X1,X2),X1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_15,plain,
! [X42,X43] :
( ( ~ in(X42,X43)
| flp(X42,X43) )
& ( ~ an(X42,X43)
| flp(X42,X43) )
& ( ~ bei(X42,X43)
| flp(X42,X43) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[local_function___flp])])])]) ).
cnf(c_0_16,hypothesis,
( ~ flp(X1,X2)
| ~ scar(esk3_2(c43,c79),X3)
| ~ loc(esk3_2(c43,c79),X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,hypothesis,
scar(esk3_2(c43,c79),c43),
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_18,plain,
( loc(esk3_2(X1,X2),X2)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,plain,
( flp(X1,X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,hypothesis,
in(c79,c23),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mira_wp_203_a19713]) ).
cnf(c_0_21,hypothesis,
( ~ flp(X1,X2)
| ~ loc(esk3_2(c43,c79),X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,hypothesis,
loc(esk3_2(c43,c79),c79),
inference(spm,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_23,hypothesis,
flp(c79,c23),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,hypothesis,
~ flp(c79,X1),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_23,c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 1.07/1.16 % Problem : CSR113+15 : TPTP v8.1.2. Released v4.0.0.
% 1.07/1.17 % Command : run_E %s %d THM
% 1.16/1.38 % Computer : n003.cluster.edu
% 1.16/1.38 % Model : x86_64 x86_64
% 1.16/1.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.16/1.38 % Memory : 8042.1875MB
% 1.16/1.38 % OS : Linux 3.10.0-693.el7.x86_64
% 1.16/1.38 % CPULimit : 300
% 1.16/1.38 % WCLimit : 300
% 1.16/1.38 % DateTime : Fri May 3 14:26:09 EDT 2024
% 1.16/1.38 % CPUTime :
% 2.34/2.52 Running first-order theorem proving
% 2.34/2.52 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.3OyY13d6TP/E---3.1_28097.p
% 2.36/2.74 # Version: 3.1.0
% 2.36/2.74 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.36/2.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.36/2.74 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.36/2.74 # Starting new_bool_3 with 300s (1) cores
% 2.36/2.74 # Starting new_bool_1 with 300s (1) cores
% 2.36/2.74 # Starting sh5l with 300s (1) cores
% 2.36/2.74 # new_bool_1 with pid 28177 completed with status 0
% 2.36/2.74 # Result found by new_bool_1
% 2.36/2.74 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.36/2.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.36/2.74 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.36/2.74 # Starting new_bool_3 with 300s (1) cores
% 2.36/2.74 # Starting new_bool_1 with 300s (1) cores
% 2.36/2.74 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.36/2.74 # Search class: FHHNF-FFMM32-SFFFFFNN
% 2.36/2.74 # partial match(1): FGHNF-FFMM32-SFFFFFNN
% 2.36/2.74 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.36/2.74 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 181s (1) cores
% 2.36/2.74 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 28180 completed with status 0
% 2.36/2.74 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 2.36/2.74 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.36/2.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.36/2.74 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.36/2.74 # Starting new_bool_3 with 300s (1) cores
% 2.36/2.74 # Starting new_bool_1 with 300s (1) cores
% 2.36/2.74 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.36/2.74 # Search class: FHHNF-FFMM32-SFFFFFNN
% 2.36/2.74 # partial match(1): FGHNF-FFMM32-SFFFFFNN
% 2.36/2.74 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.36/2.74 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 181s (1) cores
% 2.36/2.74 # Preprocessing time : 0.013 s
% 2.36/2.74 # Presaturation interreduction done
% 2.36/2.74
% 2.36/2.74 # Proof found!
% 2.36/2.74 # SZS status Theorem
% 2.36/2.74 # SZS output start CNFRefutation
% See solution above
% 2.36/2.74 # Parsed axioms : 10189
% 2.36/2.74 # Removed by relevancy pruning/SinE : 10126
% 2.36/2.74 # Initial clauses : 243
% 2.36/2.74 # Removed in clause preprocessing : 0
% 2.36/2.74 # Initial clauses in saturation : 243
% 2.36/2.74 # Processed clauses : 647
% 2.36/2.74 # ...of these trivial : 2
% 2.36/2.74 # ...subsumed : 0
% 2.36/2.74 # ...remaining for further processing : 645
% 2.36/2.74 # Other redundant clauses eliminated : 0
% 2.36/2.74 # Clauses deleted for lack of memory : 0
% 2.36/2.74 # Backward-subsumed : 2
% 2.36/2.74 # Backward-rewritten : 0
% 2.36/2.74 # Generated clauses : 213
% 2.36/2.74 # ...of the previous two non-redundant : 212
% 2.36/2.74 # ...aggressively subsumed : 0
% 2.36/2.74 # Contextual simplify-reflections : 0
% 2.36/2.74 # Paramodulations : 212
% 2.36/2.74 # Factorizations : 0
% 2.36/2.74 # NegExts : 0
% 2.36/2.74 # Equation resolutions : 0
% 2.36/2.74 # Disequality decompositions : 0
% 2.36/2.74 # Total rewrite steps : 3
% 2.36/2.74 # ...of those cached : 0
% 2.36/2.74 # Propositional unsat checks : 0
% 2.36/2.74 # Propositional check models : 0
% 2.36/2.74 # Propositional check unsatisfiable : 0
% 2.36/2.74 # Propositional clauses : 0
% 2.36/2.74 # Propositional clauses after purity: 0
% 2.36/2.74 # Propositional unsat core size : 0
% 2.36/2.74 # Propositional preprocessing time : 0.000
% 2.36/2.74 # Propositional encoding time : 0.000
% 2.36/2.74 # Propositional solver time : 0.000
% 2.36/2.74 # Success case prop preproc time : 0.000
% 2.36/2.74 # Success case prop encoding time : 0.000
% 2.36/2.74 # Success case prop solver time : 0.000
% 2.36/2.74 # Current number of processed clauses : 401
% 2.36/2.74 # Positive orientable unit clauses : 318
% 2.36/2.74 # Positive unorientable unit clauses: 0
% 2.36/2.74 # Negative unit clauses : 1
% 2.36/2.74 # Non-unit-clauses : 82
% 2.36/2.74 # Current number of unprocessed clauses: 49
% 2.36/2.74 # ...number of literals in the above : 134
% 2.36/2.74 # Current number of archived formulas : 0
% 2.36/2.74 # Current number of archived clauses : 244
% 2.36/2.74 # Clause-clause subsumption calls (NU) : 2567
% 2.36/2.74 # Rec. Clause-clause subsumption calls : 941
% 2.36/2.74 # Non-unit clause-clause subsumptions : 2
% 2.36/2.74 # Unit Clause-clause subsumption calls : 844
% 2.36/2.74 # Rewrite failures with RHS unbound : 0
% 2.36/2.74 # BW rewrite match attempts : 0
% 2.36/2.74 # BW rewrite match successes : 0
% 2.36/2.74 # Condensation attempts : 0
% 2.36/2.74 # Condensation successes : 0
% 2.36/2.74 # Termbank termtop insertions : 53340
% 2.36/2.74 # Search garbage collected termcells : 39144
% 2.36/2.74
% 2.36/2.74 # -------------------------------------------------
% 2.36/2.74 # User time : 0.082 s
% 2.36/2.74 # System time : 0.068 s
% 2.36/2.74 # Total time : 0.149 s
% 2.36/2.74 # Maximum resident set size: 42632 pages
% 2.36/2.74
% 2.36/2.74 # -------------------------------------------------
% 2.36/2.74 # User time : 0.117 s
% 2.36/2.74 # System time : 0.078 s
% 2.36/2.74 # Total time : 0.195 s
% 2.36/2.74 # Maximum resident set size: 10796 pages
% 2.36/2.74 % E---3.1 exiting
% 2.36/2.75 % E exiting
%------------------------------------------------------------------------------