TSTP Solution File: CSR113+26 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR113+26 : 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:37:33 EDT 2024
% Result : Theorem 1.68s 2.13s
% Output : CNFRefutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 6 unt; 0 def)
% Number of atoms : 252 ( 0 equ)
% Maximal formula atoms : 194 ( 12 avg)
% Number of connectives : 264 ( 32 ~; 24 |; 207 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 194 ( 14 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 23 ( 22 usr; 1 prp; 0-3 aty)
% Number of functors : 54 ( 54 usr; 53 con; 0-2 aty)
% Number of variables : 47 ( 13 sgn 9 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_003_mw3_123,conjecture,
? [X1,X2,X3,X4,X5] :
( attr(X3,X2)
& loc(X4,X1)
& scar(X4,X5)
& sub(X2,name_1_1)
& subs(X4,stehen_1_1)
& val(X2,usa_0) ),
file('/export/starexec/sandbox/tmp/tmp.L3xGAtsqwe/E---3.1_28844.p',synth_qa07_003_mw3_123) ).
fof(ave07_era5_synth_qa07_003_mw3_123,hypothesis,
( prop(c11,aktuell_1_1)
& sub(c11,uncle_1_1)
& attr(c17,c18)
& sub(c17,mensch_1_1)
& sub(c18,familiename_1_1)
& val(c18,sam_0)
& prop(c23,c27)
& sub(c23,nationalsymbol_1_1)
& supl(c27,wichtig_1_1,c28)
& attch(c32,c23)
& attr(c32,c33)
& sub(c32,land_1_1)
& sub(c33,name_1_1)
& val(c33,usa_0)
& neben(c35,c4)
& sub(c4,freiheitsstatue_1_1)
& arg1(c9,c11)
& arg2(c9,aktuell_1_1)
& assoc(c9,c17)
& assoc(c9,c23)
& loc(c9,c35)
& subr(c9,prop_0)
& assoc(freiheitsstatue_1_1,freiheit_1_1)
& sub(freiheitsstatue_1_1,statue_1_1)
& assoc(nationalsymbol_1_1,national__1_1)
& sub(nationalsymbol_1_1,symbol_1_1)
& sort(c11,o)
& card(c11,int1)
& etype(c11,int0)
& fact(c11,real)
& gener(c11,gener_c)
& quant(c11,one)
& refer(c11,refer_c)
& varia(c11,varia_c)
& sort(aktuell_1_1,tq)
& sort(uncle_1_1,o)
& card(uncle_1_1,int1)
& etype(uncle_1_1,int0)
& fact(uncle_1_1,real)
& gener(uncle_1_1,ge)
& quant(uncle_1_1,one)
& refer(uncle_1_1,refer_c)
& varia(uncle_1_1,varia_c)
& sort(c17,d)
& card(c17,int1)
& etype(c17,int0)
& fact(c17,real)
& gener(c17,sp)
& quant(c17,one)
& refer(c17,det)
& varia(c17,con)
& sort(c18,na)
& card(c18,int1)
& etype(c18,int0)
& fact(c18,real)
& gener(c18,sp)
& quant(c18,one)
& refer(c18,indet)
& varia(c18,varia_c)
& sort(mensch_1_1,d)
& card(mensch_1_1,int1)
& etype(mensch_1_1,int0)
& fact(mensch_1_1,real)
& gener(mensch_1_1,ge)
& quant(mensch_1_1,one)
& refer(mensch_1_1,refer_c)
& varia(mensch_1_1,varia_c)
& sort(familiename_1_1,na)
& card(familiename_1_1,int1)
& etype(familiename_1_1,int0)
& fact(familiename_1_1,real)
& gener(familiename_1_1,ge)
& quant(familiename_1_1,one)
& refer(familiename_1_1,refer_c)
& varia(familiename_1_1,varia_c)
& sort(sam_0,fe)
& sort(c23,io)
& card(c23,int1)
& etype(c23,int0)
& fact(c23,real)
& gener(c23,sp)
& quant(c23,one)
& refer(c23,det)
& varia(c23,con)
& sort(c27,tq)
& sort(nationalsymbol_1_1,io)
& card(nationalsymbol_1_1,int1)
& etype(nationalsymbol_1_1,int0)
& fact(nationalsymbol_1_1,real)
& gener(nationalsymbol_1_1,ge)
& quant(nationalsymbol_1_1,one)
& refer(nationalsymbol_1_1,refer_c)
& varia(nationalsymbol_1_1,varia_c)
& sort(wichtig_1_1,nq)
& sort(c28,o)
& card(c28,card_c)
& etype(c28,int1)
& etype(c28,int2)
& fact(c28,real)
& gener(c28,gener_c)
& quant(c28,quant_c)
& refer(c28,refer_c)
& varia(c28,varia_c)
& sort(c32,d)
& sort(c32,io)
& card(c32,int1)
& etype(c32,int0)
& fact(c32,real)
& gener(c32,sp)
& quant(c32,one)
& refer(c32,det)
& varia(c32,con)
& sort(c33,na)
& card(c33,int1)
& etype(c33,int0)
& fact(c33,real)
& gener(c33,sp)
& quant(c33,one)
& refer(c33,indet)
& varia(c33,varia_c)
& sort(land_1_1,d)
& sort(land_1_1,io)
& card(land_1_1,int1)
& etype(land_1_1,int0)
& fact(land_1_1,real)
& gener(land_1_1,ge)
& quant(land_1_1,one)
& refer(land_1_1,refer_c)
& varia(land_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(usa_0,fe)
& sort(c35,l)
& card(c35,int1)
& etype(c35,int0)
& fact(c35,real)
& gener(c35,sp)
& quant(c35,one)
& refer(c35,det)
& varia(c35,con)
& sort(c4,d)
& card(c4,int1)
& etype(c4,int0)
& fact(c4,real)
& gener(c4,sp)
& quant(c4,one)
& refer(c4,det)
& varia(c4,con)
& 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(c9,st)
& fact(c9,real)
& gener(c9,sp)
& sort(prop_0,st)
& fact(prop_0,real)
& gener(prop_0,gener_c)
& 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)
& sort(national__1_1,nq)
& sort(symbol_1_1,io)
& card(symbol_1_1,int1)
& etype(symbol_1_1,int0)
& fact(symbol_1_1,real)
& gener(symbol_1_1,ge)
& quant(symbol_1_1,one)
& refer(symbol_1_1,refer_c)
& varia(symbol_1_1,varia_c) ),
file('/export/starexec/sandbox/tmp/tmp.L3xGAtsqwe/E---3.1_28844.p',ave07_era5_synth_qa07_003_mw3_123) ).
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/tmp/tmp.L3xGAtsqwe/E---3.1_28844.p',loc__stehen_1_1_loc) ).
fof(c_0_3,negated_conjecture,
~ ? [X1,X2,X3,X4,X5] :
( attr(X3,X2)
& loc(X4,X1)
& scar(X4,X5)
& sub(X2,name_1_1)
& subs(X4,stehen_1_1)
& val(X2,usa_0) ),
inference(assume_negation,[status(cth)],[synth_qa07_003_mw3_123]) ).
fof(c_0_4,negated_conjecture,
! [X8,X9,X10,X11,X12] :
( ~ attr(X10,X9)
| ~ loc(X11,X8)
| ~ scar(X11,X12)
| ~ sub(X9,name_1_1)
| ~ subs(X11,stehen_1_1)
| ~ val(X9,usa_0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_5,negated_conjecture,
( ~ attr(X1,X2)
| ~ loc(X3,X4)
| ~ scar(X3,X5)
| ~ sub(X2,name_1_1)
| ~ subs(X3,stehen_1_1)
| ~ val(X2,usa_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,hypothesis,
val(c33,usa_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mw3_123]) ).
cnf(c_0_7,hypothesis,
sub(c33,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mw3_123]) ).
cnf(c_0_8,hypothesis,
( ~ attr(X1,c33)
| ~ scar(X2,X3)
| ~ loc(X2,X4)
| ~ subs(X2,stehen_1_1) ),
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(c32,c33),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mw3_123]) ).
fof(c_0_10,plain,
! [X36,X37] :
( ( loc(esk6_2(X36,X37),X37)
| ~ loc(X36,X37) )
& ( scar(esk6_2(X36,X37),X36)
| ~ loc(X36,X37) )
& ( subs(esk6_2(X36,X37),stehen_1_1)
| ~ loc(X36,X37) ) ),
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_11,hypothesis,
( ~ scar(X1,X2)
| ~ loc(X1,X3)
| ~ subs(X1,stehen_1_1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( subs(esk6_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,hypothesis,
( ~ scar(esk6_2(X1,X2),X3)
| ~ loc(esk6_2(X1,X2),X4)
| ~ loc(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
( scar(esk6_2(X1,X2),X1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,hypothesis,
( ~ loc(esk6_2(X1,X2),X3)
| ~ loc(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
( loc(esk6_2(X1,X2),X2)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,hypothesis,
loc(c9,c35),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_003_mw3_123]) ).
cnf(c_0_18,hypothesis,
~ loc(X1,X2),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_17,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR113+26 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n010.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 : 300
% 0.13/0.34 % DateTime : Fri May 3 14:57:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 1.65/1.84 Running first-order model finding
% 1.65/1.84 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/tmp/tmp.L3xGAtsqwe/E---3.1_28844.p
% 1.68/2.13 # Version: 3.1.0
% 1.68/2.13 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.68/2.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.68/2.13 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.68/2.13 # Starting new_bool_3 with 300s (1) cores
% 1.68/2.13 # Starting new_bool_1 with 300s (1) cores
% 1.68/2.13 # Starting sh5l with 300s (1) cores
% 1.68/2.13 # new_bool_3 with pid 29063 completed with status 0
% 1.68/2.13 # Result found by new_bool_3
% 1.68/2.13 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.68/2.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.68/2.13 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.68/2.13 # Starting new_bool_3 with 300s (1) cores
% 1.68/2.13 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.68/2.13 # Search class: FHHNF-FSLM32-MFFFFFNN
% 1.68/2.13 # partial match(2): FGHSF-FSLM32-MFFFFFNN
% 1.68/2.13 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.68/2.13 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 163s (1) cores
% 1.68/2.13 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 29070 completed with status 0
% 1.68/2.13 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.68/2.13 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.68/2.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.68/2.13 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.68/2.13 # Starting new_bool_3 with 300s (1) cores
% 1.68/2.13 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.68/2.13 # Search class: FHHNF-FSLM32-MFFFFFNN
% 1.68/2.13 # partial match(2): FGHSF-FSLM32-MFFFFFNN
% 1.68/2.13 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.68/2.13 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 163s (1) cores
% 1.68/2.13 # Preprocessing time : 0.012 s
% 1.68/2.13 # Presaturation interreduction done
% 1.68/2.13
% 1.68/2.13 # Proof found!
% 1.68/2.13 # SZS status Theorem
% 1.68/2.13 # SZS output start CNFRefutation
% See solution above
% 1.68/2.13 # Parsed axioms : 10189
% 1.68/2.13 # Removed by relevancy pruning/SinE : 10104
% 1.68/2.13 # Initial clauses : 316
% 1.68/2.13 # Removed in clause preprocessing : 0
% 1.68/2.13 # Initial clauses in saturation : 316
% 1.68/2.13 # Processed clauses : 715
% 1.68/2.13 # ...of these trivial : 2
% 1.68/2.13 # ...subsumed : 1
% 1.68/2.13 # ...remaining for further processing : 712
% 1.68/2.13 # Other redundant clauses eliminated : 0
% 1.68/2.13 # Clauses deleted for lack of memory : 0
% 1.68/2.13 # Backward-subsumed : 15
% 1.68/2.13 # Backward-rewritten : 0
% 1.68/2.13 # Generated clauses : 177
% 1.68/2.13 # ...of the previous two non-redundant : 173
% 1.68/2.13 # ...aggressively subsumed : 0
% 1.68/2.13 # Contextual simplify-reflections : 0
% 1.68/2.13 # Paramodulations : 176
% 1.68/2.13 # Factorizations : 0
% 1.68/2.13 # NegExts : 0
% 1.68/2.13 # Equation resolutions : 0
% 1.68/2.13 # Disequality decompositions : 0
% 1.68/2.13 # Total rewrite steps : 3
% 1.68/2.13 # ...of those cached : 0
% 1.68/2.13 # Propositional unsat checks : 0
% 1.68/2.13 # Propositional check models : 0
% 1.68/2.13 # Propositional check unsatisfiable : 0
% 1.68/2.13 # Propositional clauses : 0
% 1.68/2.13 # Propositional clauses after purity: 0
% 1.68/2.13 # Propositional unsat core size : 0
% 1.68/2.13 # Propositional preprocessing time : 0.000
% 1.68/2.13 # Propositional encoding time : 0.000
% 1.68/2.13 # Propositional solver time : 0.000
% 1.68/2.13 # Success case prop preproc time : 0.000
% 1.68/2.13 # Success case prop encoding time : 0.000
% 1.68/2.13 # Success case prop solver time : 0.000
% 1.68/2.13 # Current number of processed clauses : 382
% 1.68/2.13 # Positive orientable unit clauses : 265
% 1.68/2.13 # Positive unorientable unit clauses: 0
% 1.68/2.13 # Negative unit clauses : 1
% 1.68/2.13 # Non-unit-clauses : 116
% 1.68/2.13 # Current number of unprocessed clauses: 88
% 1.68/2.13 # ...number of literals in the above : 366
% 1.68/2.13 # Current number of archived formulas : 0
% 1.68/2.13 # Current number of archived clauses : 330
% 1.68/2.13 # Clause-clause subsumption calls (NU) : 5568
% 1.68/2.13 # Rec. Clause-clause subsumption calls : 3202
% 1.68/2.13 # Non-unit clause-clause subsumptions : 5
% 1.68/2.13 # Unit Clause-clause subsumption calls : 142
% 1.68/2.13 # Rewrite failures with RHS unbound : 0
% 1.68/2.13 # BW rewrite match attempts : 0
% 1.68/2.13 # BW rewrite match successes : 0
% 1.68/2.13 # Condensation attempts : 0
% 1.68/2.13 # Condensation successes : 0
% 1.68/2.13 # Termbank termtop insertions : 56775
% 1.68/2.13 # Search garbage collected termcells : 39253
% 1.68/2.13
% 1.68/2.13 # -------------------------------------------------
% 1.68/2.13 # User time : 0.080 s
% 1.68/2.13 # System time : 0.059 s
% 1.68/2.13 # Total time : 0.139 s
% 1.68/2.13 # Maximum resident set size: 42780 pages
% 1.68/2.13
% 1.68/2.13 # -------------------------------------------------
% 1.68/2.13 # User time : 0.167 s
% 1.68/2.13 # System time : 0.071 s
% 1.68/2.13 # Total time : 0.238 s
% 1.68/2.13 # Maximum resident set size: 10812 pages
% 1.68/2.13 % E---3.1 exiting
%------------------------------------------------------------------------------