TSTP Solution File: CSR113+17 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR113+17 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 3.97s 3.00s
% Output : CNFRefutation 3.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 9 unt; 0 def)
% Number of atoms : 227 ( 0 equ)
% Maximal formula atoms : 156 ( 9 avg)
% Number of connectives : 242 ( 40 ~; 31 |; 169 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 156 ( 10 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 26 ( 25 usr; 1 prp; 0-2 aty)
% Number of functors : 48 ( 48 usr; 46 con; 0-3 aty)
% Number of variables : 62 ( 16 sgn 21 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_003_mira_wp_212_a19713,conjecture,
? [X1,X2,X3,X4,X5] :
( flp(X1,X3)
& scar(X4,X5)
& sub(X2,name_1_1)
& val(X2,new_york_0) ),
file('/export/starexec/sandbox/tmp/tmp.xH4hvHo9SG/E---3.1_21582.p',synth_qa07_003_mira_wp_212_a19713) ).
fof(ave07_era5_synth_qa07_003_mira_wp_212_a19713,hypothesis,
( sub(c2034,mine_1_3)
& arg1(c2528,c2549)
& arg2(c2528,c2034)
& subs(c2528,stammen_1_2)
& benf(c2549,c2555)
& origl(c2549,c2588)
& sub(c2549,kupfer_1_1)
& sub(c2555,freiheitsstatue_1_1)
& pred(c2571,franzose_1_1)
& agt(c2578,c2571)
& obj(c2578,c2555)
& ornt(c2578,c2580)
& subs(c2578,schenken_1_1)
& attr(c2580,c2581)
& sub(c2580,stadt__1_1)
& sub(c2581,name_1_1)
& val(c2581,new_york_0)
& flp(c2588,c2034)
& assoc(freiheitsstatue_1_1,freiheit_1_1)
& sub(freiheitsstatue_1_1,statue_1_1)
& sort(c2034,d)
& card(c2034,int1)
& etype(c2034,int0)
& fact(c2034,real)
& gener(c2034,sp)
& quant(c2034,one)
& refer(c2034,det)
& varia(c2034,varia_c)
& sort(mine_1_3,d)
& card(mine_1_3,int1)
& etype(mine_1_3,int0)
& fact(mine_1_3,real)
& gener(mine_1_3,ge)
& quant(mine_1_3,one)
& refer(mine_1_3,refer_c)
& varia(mine_1_3,varia_c)
& sort(c2528,st)
& fact(c2528,real)
& gener(c2528,sp)
& sort(c2549,s)
& card(c2549,int1)
& etype(c2549,int0)
& fact(c2549,real)
& gener(c2549,sp)
& quant(c2549,one)
& refer(c2549,det)
& varia(c2549,con)
& sort(stammen_1_2,st)
& fact(stammen_1_2,real)
& gener(stammen_1_2,ge)
& sort(c2555,d)
& card(c2555,int1)
& etype(c2555,int0)
& fact(c2555,real)
& gener(c2555,sp)
& quant(c2555,one)
& refer(c2555,det)
& varia(c2555,con)
& sort(c2588,l)
& card(c2588,int1)
& etype(c2588,int0)
& fact(c2588,real)
& gener(c2588,sp)
& quant(c2588,one)
& refer(c2588,det)
& varia(c2588,con)
& sort(kupfer_1_1,s)
& card(kupfer_1_1,int1)
& etype(kupfer_1_1,int0)
& fact(kupfer_1_1,real)
& gener(kupfer_1_1,ge)
& quant(kupfer_1_1,one)
& refer(kupfer_1_1,refer_c)
& varia(kupfer_1_1,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(c2571,d)
& card(c2571,cons(x_constant,cons(int1,nil)))
& etype(c2571,int1)
& fact(c2571,real)
& gener(c2571,sp)
& quant(c2571,mult)
& refer(c2571,det)
& varia(c2571,con)
& sort(franzose_1_1,d)
& card(franzose_1_1,int1)
& etype(franzose_1_1,int0)
& fact(franzose_1_1,real)
& gener(franzose_1_1,ge)
& quant(franzose_1_1,one)
& refer(franzose_1_1,refer_c)
& varia(franzose_1_1,varia_c)
& sort(c2578,da)
& fact(c2578,real)
& gener(c2578,sp)
& sort(c2580,d)
& sort(c2580,io)
& card(c2580,int1)
& etype(c2580,int0)
& fact(c2580,real)
& gener(c2580,sp)
& quant(c2580,one)
& refer(c2580,det)
& varia(c2580,con)
& sort(schenken_1_1,da)
& fact(schenken_1_1,real)
& gener(schenken_1_1,ge)
& sort(c2581,na)
& card(c2581,int1)
& etype(c2581,int0)
& fact(c2581,real)
& gener(c2581,sp)
& quant(c2581,one)
& refer(c2581,indet)
& varia(c2581,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(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/tmp/tmp.xH4hvHo9SG/E---3.1_21582.p',ave07_era5_synth_qa07_003_mira_wp_212_a19713) ).
fof(attr_name__abk__374rzung_stehen_1_b_f__374r,axiom,
! [X1,X2,X3] :
( ( attr(X3,X1)
& member(X2,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
& sub(X1,X2) )
=> ? [X4] :
( mcont(X4,X3)
& obj(X4,X3)
& scar(X4,X3)
& subs(X4,stehen_1_b) ) ),
file('/export/starexec/sandbox/tmp/tmp.xH4hvHo9SG/E---3.1_21582.p',attr_name__abk__374rzung_stehen_1_b_f__374r) ).
fof(member_second,axiom,
! [X1,X2,X3] :
( member(X1,X3)
=> member(X1,cons(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.xH4hvHo9SG/E---3.1_21582.p',member_second) ).
fof(member_first,axiom,
! [X1,X2] : member(X1,cons(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.xH4hvHo9SG/E---3.1_21582.p',member_first) ).
fof(c_0_5,negated_conjecture,
~ ? [X1,X2,X3,X4,X5] :
( flp(X1,X3)
& scar(X4,X5)
& sub(X2,name_1_1)
& val(X2,new_york_0) ),
inference(assume_negation,[status(cth)],[synth_qa07_003_mira_wp_212_a19713]) ).
fof(c_0_6,negated_conjecture,
! [X8,X9,X10,X11,X12] :
( ~ flp(X8,X10)
| ~ scar(X11,X12)
| ~ sub(X9,name_1_1)
| ~ val(X9,new_york_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,
( ~ flp(X1,X2)
| ~ scar(X3,X4)
| ~ sub(X5,name_1_1)
| ~ val(X5,new_york_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_8,hypothesis,
val(c2581,new_york_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mira_wp_212_a19713]) ).
cnf(c_0_9,hypothesis,
sub(c2581,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mira_wp_212_a19713]) ).
fof(c_0_10,plain,
! [X321,X322,X323] :
( ( mcont(esk46_3(X321,X322,X323),X323)
| ~ attr(X323,X321)
| ~ member(X322,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
| ~ sub(X321,X322) )
& ( obj(esk46_3(X321,X322,X323),X323)
| ~ attr(X323,X321)
| ~ member(X322,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
| ~ sub(X321,X322) )
& ( scar(esk46_3(X321,X322,X323),X323)
| ~ attr(X323,X321)
| ~ member(X322,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
| ~ sub(X321,X322) )
& ( subs(esk46_3(X321,X322,X323),stehen_1_b)
| ~ attr(X323,X321)
| ~ member(X322,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
| ~ sub(X321,X322) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[attr_name__abk__374rzung_stehen_1_b_f__374r])])])])]) ).
cnf(c_0_11,hypothesis,
( ~ flp(X1,X2)
| ~ scar(X3,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_12,hypothesis,
flp(c2588,c2034),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mira_wp_212_a19713]) ).
cnf(c_0_13,plain,
( scar(esk46_3(X1,X2,X3),X3)
| ~ attr(X3,X1)
| ~ member(X2,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
| ~ sub(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,hypothesis,
~ scar(X1,X2),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_15,plain,
! [X111,X112,X113] :
( ~ member(X111,X113)
| member(X111,cons(X112,X113)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[member_second])])]) ).
cnf(c_0_16,plain,
( ~ attr(X1,X2)
| ~ sub(X2,X3)
| ~ member(X3,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) ),
inference(sr,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( member(X1,cons(X3,X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,plain,
( ~ attr(X1,X2)
| ~ sub(X2,X3)
| ~ member(X3,cons(familiename_1_1,cons(name_1_1,nil))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_19,plain,
! [X109,X110] : member(X109,cons(X109,X110)),
inference(variable_rename,[status(thm)],[member_first]) ).
cnf(c_0_20,plain,
( ~ attr(X1,X2)
| ~ sub(X2,X3)
| ~ member(X3,cons(name_1_1,nil)) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_21,plain,
member(X1,cons(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,plain,
( ~ attr(X1,X2)
| ~ sub(X2,name_1_1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,hypothesis,
attr(c2580,c2581),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mira_wp_212_a19713]) ).
cnf(c_0_24,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 1.05/1.16 % Problem : CSR113+17 : TPTP v8.1.2. Released v4.0.0.
% 1.05/1.17 % Command : run_E %s %d THM
% 1.16/1.37 % Computer : n010.cluster.edu
% 1.16/1.37 % Model : x86_64 x86_64
% 1.16/1.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.16/1.37 % Memory : 8042.1875MB
% 1.16/1.37 % OS : Linux 3.10.0-693.el7.x86_64
% 1.16/1.37 % CPULimit : 300
% 1.16/1.37 % WCLimit : 300
% 1.16/1.38 % DateTime : Fri May 3 15:06:09 EDT 2024
% 1.16/1.38 % CPUTime :
% 2.50/2.66 Running first-order theorem proving
% 2.50/2.66 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/tmp/tmp.xH4hvHo9SG/E---3.1_21582.p
% 3.97/3.00 # Version: 3.1.0
% 3.97/3.00 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.97/3.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.97/3.00 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.97/3.00 # Starting new_bool_3 with 300s (1) cores
% 3.97/3.00 # Starting new_bool_1 with 300s (1) cores
% 3.97/3.00 # Starting sh5l with 300s (1) cores
% 3.97/3.00 # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 21676 completed with status 0
% 3.97/3.00 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 3.97/3.00 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.97/3.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.97/3.00 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.97/3.00 # SinE strategy is gf500_h_gu_R04_F100_L20000
% 3.97/3.00 # Search class: FHHNS-FSLM32-MFFFFFNN
% 3.97/3.00 # partial match(2): FHHNS-SMLM32-MFFFFFNN
% 3.97/3.00 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.97/3.00 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 3.97/3.00 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 3.97/3.00 # Starting new_bool_3 with 136s (1) cores
% 3.97/3.00 # Starting new_bool_1 with 136s (1) cores
% 3.97/3.00 # Starting sh5l with 136s (1) cores
% 3.97/3.00 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 21682 completed with status 0
% 3.97/3.00 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 3.97/3.00 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.97/3.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.97/3.00 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.97/3.00 # SinE strategy is gf500_h_gu_R04_F100_L20000
% 3.97/3.00 # Search class: FHHNS-FSLM32-MFFFFFNN
% 3.97/3.00 # partial match(2): FHHNS-SMLM32-MFFFFFNN
% 3.97/3.00 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.97/3.00 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 3.97/3.00 # Preprocessing time : 0.019 s
% 3.97/3.00 # Presaturation interreduction done
% 3.97/3.00
% 3.97/3.00 # Proof found!
% 3.97/3.00 # SZS status Theorem
% 3.97/3.00 # SZS output start CNFRefutation
% See solution above
% 3.97/3.00 # Parsed axioms : 10189
% 3.97/3.00 # Removed by relevancy pruning/SinE : 9938
% 3.97/3.00 # Initial clauses : 560
% 3.97/3.00 # Removed in clause preprocessing : 0
% 3.97/3.00 # Initial clauses in saturation : 560
% 3.97/3.00 # Processed clauses : 1296
% 3.97/3.00 # ...of these trivial : 2
% 3.97/3.00 # ...subsumed : 58
% 3.97/3.00 # ...remaining for further processing : 1236
% 3.97/3.00 # Other redundant clauses eliminated : 0
% 3.97/3.00 # Clauses deleted for lack of memory : 0
% 3.97/3.00 # Backward-subsumed : 15
% 3.97/3.00 # Backward-rewritten : 0
% 3.97/3.00 # Generated clauses : 510
% 3.97/3.00 # ...of the previous two non-redundant : 509
% 3.97/3.00 # ...aggressively subsumed : 0
% 3.97/3.00 # Contextual simplify-reflections : 0
% 3.97/3.00 # Paramodulations : 510
% 3.97/3.00 # Factorizations : 0
% 3.97/3.00 # NegExts : 0
% 3.97/3.00 # Equation resolutions : 0
% 3.97/3.00 # Disequality decompositions : 0
% 3.97/3.00 # Total rewrite steps : 4
% 3.97/3.00 # ...of those cached : 1
% 3.97/3.00 # Propositional unsat checks : 0
% 3.97/3.00 # Propositional check models : 0
% 3.97/3.00 # Propositional check unsatisfiable : 0
% 3.97/3.00 # Propositional clauses : 0
% 3.97/3.00 # Propositional clauses after purity: 0
% 3.97/3.00 # Propositional unsat core size : 0
% 3.97/3.00 # Propositional preprocessing time : 0.000
% 3.97/3.00 # Propositional encoding time : 0.000
% 3.97/3.00 # Propositional solver time : 0.000
% 3.97/3.00 # Success case prop preproc time : 0.000
% 3.97/3.00 # Success case prop encoding time : 0.000
% 3.97/3.00 # Success case prop solver time : 0.000
% 3.97/3.00 # Current number of processed clauses : 663
% 3.97/3.00 # Positive orientable unit clauses : 358
% 3.97/3.00 # Positive unorientable unit clauses: 0
% 3.97/3.00 # Negative unit clauses : 8
% 3.97/3.00 # Non-unit-clauses : 297
% 3.97/3.00 # Current number of unprocessed clauses: 330
% 3.97/3.00 # ...number of literals in the above : 1176
% 3.97/3.00 # Current number of archived formulas : 0
% 3.97/3.00 # Current number of archived clauses : 573
% 3.97/3.00 # Clause-clause subsumption calls (NU) : 37467
% 3.97/3.00 # Rec. Clause-clause subsumption calls : 16565
% 3.97/3.00 # Non-unit clause-clause subsumptions : 42
% 3.97/3.00 # Unit Clause-clause subsumption calls : 1120
% 3.97/3.00 # Rewrite failures with RHS unbound : 0
% 3.97/3.00 # BW rewrite match attempts : 0
% 3.97/3.00 # BW rewrite match successes : 0
% 3.97/3.00 # Condensation attempts : 0
% 3.97/3.00 # Condensation successes : 0
% 3.97/3.00 # Termbank termtop insertions : 75567
% 3.97/3.00 # Search garbage collected termcells : 40663
% 3.97/3.00
% 3.97/3.00 # -------------------------------------------------
% 3.97/3.00 # User time : 0.121 s
% 3.97/3.00 # System time : 0.085 s
% 3.97/3.00 # Total time : 0.206 s
% 3.97/3.00 # Maximum resident set size: 47992 pages
% 3.97/3.00
% 3.97/3.00 # -------------------------------------------------
% 3.97/3.00 # User time : 0.602 s
% 3.97/3.00 # System time : 0.160 s
% 3.97/3.00 # Total time : 0.762 s
% 3.97/3.00 # Maximum resident set size: 10792 pages
% 3.97/3.00 % E---3.1 exiting
% 3.97/3.01 % E exiting
%------------------------------------------------------------------------------