TSTP Solution File: CSR114+20 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR114+20 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:42 EDT 2024
% Result : Theorem 2.15s 1.87s
% Output : CNFRefutation 2.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 8 unt; 0 def)
% Number of atoms : 278 ( 0 equ)
% Maximal formula atoms : 193 ( 11 avg)
% Number of connectives : 304 ( 50 ~; 41 |; 212 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 193 ( 13 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 24 ( 23 usr; 1 prp; 0-2 aty)
% Number of functors : 49 ( 49 usr; 48 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn 9 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_004_qapn_67,conjecture,
? [X1,X2,X3,X4,X5] :
( in(X3,X1)
& attr(X1,X2)
& loc(X5,X3)
& scar(X5,X4)
& sub(X2,name_1_1)
& sub(X1,stadt__1_1)
& sub(X4,kolosseum_1_1)
& subs(X5,stehen_1_1)
& val(X2,rom_0) ),
file('/export/starexec/sandbox2/tmp/tmp.tCfkdZsSTb/E---3.1_12014.p',synth_qa07_004_qapn_67) ).
fof(ave07_era5_synth_qa07_004_qapn_67,hypothesis,
( attch(c11,c4)
& sub(c11,republik__1_1)
& agt(c15,c378)
& cstr(c15,c388)
& obj(c15,c4)
& subs(c15,verlangen_2_1)
& attr(c378,c379)
& sub(c378,mensch_1_1)
& sub(c379,familiename_1_1)
& val(c379,niebuhr_0)
& prop(c388,gro__337_1_1)
& sub(c4,palais_1_1)
& loc(c486,c505)
& sub(c486,kolosseum_1_1)
& attr(c494,c495)
& sub(c494,stadt__1_1)
& sub(c495,name_1_1)
& val(c495,rom_0)
& prop(c497,c0)
& sub(c497,klotz__1_1)
& benf(c501,c486)
& obj(c501,c497)
& semrel(c501,c15)
& subs(c501,ersetzen_1_1)
& in(c505,c494)
& chsp2(nachempfinden_1_1,c0)
& sort(c11,d)
& sort(c11,io)
& card(c11,int1)
& etype(c11,int0)
& fact(c11,real)
& gener(c11,sp)
& quant(c11,one)
& refer(c11,det)
& varia(c11,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(republik__1_1,d)
& sort(republik__1_1,io)
& card(republik__1_1,int1)
& etype(republik__1_1,int0)
& fact(republik__1_1,real)
& gener(republik__1_1,ge)
& quant(republik__1_1,one)
& refer(republik__1_1,refer_c)
& varia(republik__1_1,varia_c)
& sort(c15,da)
& fact(c15,real)
& gener(c15,sp)
& sort(c378,d)
& card(c378,int1)
& etype(c378,int0)
& fact(c378,real)
& gener(c378,sp)
& quant(c378,one)
& refer(c378,det)
& varia(c378,con)
& sort(c388,o)
& card(c388,int1)
& etype(c388,int0)
& fact(c388,real)
& gener(c388,sp)
& quant(c388,one)
& refer(c388,indet)
& varia(c388,varia_c)
& sort(verlangen_2_1,da)
& fact(verlangen_2_1,real)
& gener(verlangen_2_1,ge)
& sort(c379,na)
& card(c379,int1)
& etype(c379,int0)
& fact(c379,real)
& gener(c379,sp)
& quant(c379,one)
& refer(c379,indet)
& varia(c379,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(niebuhr_0,fe)
& sort(gro__337_1_1,mq)
& sort(palais_1_1,d)
& card(palais_1_1,int1)
& etype(palais_1_1,int0)
& fact(palais_1_1,real)
& gener(palais_1_1,ge)
& quant(palais_1_1,one)
& refer(palais_1_1,refer_c)
& varia(palais_1_1,varia_c)
& sort(c486,d)
& card(c486,int1)
& etype(c486,int0)
& fact(c486,real)
& gener(c486,sp)
& quant(c486,one)
& refer(c486,det)
& varia(c486,con)
& sort(c505,l)
& card(c505,int1)
& etype(c505,int0)
& fact(c505,real)
& gener(c505,sp)
& quant(c505,one)
& refer(c505,det)
& varia(c505,con)
& sort(kolosseum_1_1,d)
& card(kolosseum_1_1,int1)
& etype(kolosseum_1_1,int0)
& fact(kolosseum_1_1,real)
& gener(kolosseum_1_1,sp)
& quant(kolosseum_1_1,one)
& refer(kolosseum_1_1,det)
& varia(kolosseum_1_1,con)
& sort(c494,d)
& sort(c494,io)
& card(c494,int1)
& etype(c494,int0)
& fact(c494,real)
& gener(c494,sp)
& quant(c494,one)
& refer(c494,det)
& varia(c494,con)
& sort(c495,na)
& card(c495,int1)
& etype(c495,int0)
& fact(c495,real)
& gener(c495,sp)
& quant(c495,one)
& refer(c495,indet)
& varia(c495,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(rom_0,fe)
& sort(c497,d)
& card(c497,int1)
& etype(c497,int0)
& fact(c497,real)
& gener(c497,sp)
& quant(c497,one)
& refer(c497,refer_c)
& varia(c497,varia_c)
& sort(c0,tq)
& sort(klotz__1_1,d)
& card(klotz__1_1,int1)
& etype(klotz__1_1,int0)
& fact(klotz__1_1,real)
& gener(klotz__1_1,ge)
& quant(klotz__1_1,one)
& refer(klotz__1_1,refer_c)
& varia(klotz__1_1,varia_c)
& sort(c501,da)
& fact(c501,real)
& gener(c501,sp)
& sort(ersetzen_1_1,da)
& fact(ersetzen_1_1,real)
& gener(ersetzen_1_1,ge)
& sort(nachempfinden_1_1,da)
& fact(nachempfinden_1_1,real)
& gener(nachempfinden_1_1,ge) ),
file('/export/starexec/sandbox2/tmp/tmp.tCfkdZsSTb/E---3.1_12014.p',ave07_era5_synth_qa07_004_qapn_67) ).
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.tCfkdZsSTb/E---3.1_12014.p',loc__stehen_1_1_loc) ).
fof(c_0_3,negated_conjecture,
~ ? [X1,X2,X3,X4,X5] :
( in(X3,X1)
& attr(X1,X2)
& loc(X5,X3)
& scar(X5,X4)
& sub(X2,name_1_1)
& sub(X1,stadt__1_1)
& sub(X4,kolosseum_1_1)
& subs(X5,stehen_1_1)
& val(X2,rom_0) ),
inference(assume_negation,[status(cth)],[synth_qa07_004_qapn_67]) ).
fof(c_0_4,negated_conjecture,
! [X8,X9,X10,X11,X12] :
( ~ in(X10,X8)
| ~ attr(X8,X9)
| ~ loc(X12,X10)
| ~ scar(X12,X11)
| ~ sub(X9,name_1_1)
| ~ sub(X8,stadt__1_1)
| ~ sub(X11,kolosseum_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_3])])]) ).
cnf(c_0_5,negated_conjecture,
( ~ in(X1,X2)
| ~ attr(X2,X3)
| ~ loc(X4,X1)
| ~ scar(X4,X5)
| ~ sub(X3,name_1_1)
| ~ sub(X2,stadt__1_1)
| ~ sub(X5,kolosseum_1_1)
| ~ subs(X4,stehen_1_1)
| ~ val(X3,rom_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,hypothesis,
val(c495,rom_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_67]) ).
cnf(c_0_7,hypothesis,
sub(c495,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_67]) ).
cnf(c_0_8,hypothesis,
( ~ in(X1,X2)
| ~ attr(X2,c495)
| ~ scar(X3,X4)
| ~ loc(X3,X1)
| ~ subs(X3,stehen_1_1)
| ~ sub(X4,kolosseum_1_1)
| ~ sub(X2,stadt__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(c494,c495),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_67]) ).
cnf(c_0_10,hypothesis,
sub(c494,stadt__1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_67]) ).
cnf(c_0_11,hypothesis,
( ~ in(X1,c494)
| ~ scar(X2,X3)
| ~ loc(X2,X1)
| ~ subs(X2,stehen_1_1)
| ~ sub(X3,kolosseum_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_12,hypothesis,
in(c505,c494),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_67]) ).
fof(c_0_13,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_14,hypothesis,
( ~ scar(X1,X2)
| ~ loc(X1,c505)
| ~ subs(X1,stehen_1_1)
| ~ sub(X2,kolosseum_1_1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( subs(esk3_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,hypothesis,
( ~ scar(esk3_2(X1,X2),X3)
| ~ loc(esk3_2(X1,X2),c505)
| ~ loc(X1,X2)
| ~ sub(X3,kolosseum_1_1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
( loc(esk3_2(X1,X2),X2)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,hypothesis,
( ~ scar(esk3_2(X1,c505),X2)
| ~ loc(X1,c505)
| ~ sub(X2,kolosseum_1_1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
( scar(esk3_2(X1,X2),X1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,hypothesis,
( ~ loc(X1,c505)
| ~ sub(X1,kolosseum_1_1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,hypothesis,
loc(c486,c505),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_67]) ).
cnf(c_0_22,hypothesis,
sub(c486,kolosseum_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_67]) ).
cnf(c_0_23,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : CSR114+20 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 14:38:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 1.41/1.62 Running first-order model finding
% 1.41/1.62 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.tCfkdZsSTb/E---3.1_12014.p
% 2.15/1.87 # Version: 3.1.0
% 2.15/1.87 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.15/1.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.15/1.87 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.15/1.87 # Starting new_bool_3 with 300s (1) cores
% 2.15/1.87 # Starting new_bool_1 with 300s (1) cores
% 2.15/1.87 # Starting sh5l with 300s (1) cores
% 2.15/1.87 # new_bool_3 with pid 12094 completed with status 0
% 2.15/1.87 # Result found by new_bool_3
% 2.15/1.87 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.15/1.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.15/1.87 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.15/1.87 # Starting new_bool_3 with 300s (1) cores
% 2.15/1.87 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.15/1.87 # Search class: FHHNF-FSLM32-MFFFFFNN
% 2.15/1.87 # partial match(2): FGHSF-FSLM32-MFFFFFNN
% 2.15/1.87 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.15/1.87 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 163s (1) cores
% 2.15/1.87 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 12097 completed with status 0
% 2.15/1.87 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.15/1.87 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.15/1.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.15/1.87 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.15/1.87 # Starting new_bool_3 with 300s (1) cores
% 2.15/1.87 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.15/1.87 # Search class: FHHNF-FSLM32-MFFFFFNN
% 2.15/1.87 # partial match(2): FGHSF-FSLM32-MFFFFFNN
% 2.15/1.87 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.15/1.87 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 163s (1) cores
% 2.15/1.87 # Preprocessing time : 0.008 s
% 2.15/1.87 # Presaturation interreduction done
% 2.15/1.87
% 2.15/1.87 # Proof found!
% 2.15/1.87 # SZS status Theorem
% 2.15/1.87 # SZS output start CNFRefutation
% See solution above
% 2.15/1.87 # Parsed axioms : 10189
% 2.15/1.87 # Removed by relevancy pruning/SinE : 10113
% 2.15/1.87 # Initial clauses : 306
% 2.15/1.87 # Removed in clause preprocessing : 0
% 2.15/1.87 # Initial clauses in saturation : 306
% 2.15/1.87 # Processed clauses : 871
% 2.15/1.87 # ...of these trivial : 0
% 2.15/1.87 # ...subsumed : 67
% 2.15/1.87 # ...remaining for further processing : 804
% 2.15/1.87 # Other redundant clauses eliminated : 0
% 2.15/1.87 # Clauses deleted for lack of memory : 0
% 2.15/1.87 # Backward-subsumed : 0
% 2.15/1.87 # Backward-rewritten : 0
% 2.15/1.87 # Generated clauses : 551
% 2.15/1.87 # ...of the previous two non-redundant : 529
% 2.15/1.87 # ...aggressively subsumed : 0
% 2.15/1.87 # Contextual simplify-reflections : 0
% 2.15/1.87 # Paramodulations : 551
% 2.15/1.87 # Factorizations : 0
% 2.15/1.87 # NegExts : 0
% 2.15/1.87 # Equation resolutions : 0
% 2.15/1.87 # Disequality decompositions : 0
% 2.15/1.87 # Total rewrite steps : 3
% 2.15/1.87 # ...of those cached : 0
% 2.15/1.87 # Propositional unsat checks : 0
% 2.15/1.87 # Propositional check models : 0
% 2.15/1.87 # Propositional check unsatisfiable : 0
% 2.15/1.87 # Propositional clauses : 0
% 2.15/1.87 # Propositional clauses after purity: 0
% 2.15/1.87 # Propositional unsat core size : 0
% 2.15/1.87 # Propositional preprocessing time : 0.000
% 2.15/1.87 # Propositional encoding time : 0.000
% 2.15/1.87 # Propositional solver time : 0.000
% 2.15/1.87 # Success case prop preproc time : 0.000
% 2.15/1.87 # Success case prop encoding time : 0.000
% 2.15/1.87 # Success case prop solver time : 0.000
% 2.15/1.87 # Current number of processed clauses : 498
% 2.15/1.87 # Positive orientable unit clauses : 221
% 2.15/1.87 # Positive unorientable unit clauses: 0
% 2.15/1.87 # Negative unit clauses : 0
% 2.15/1.87 # Non-unit-clauses : 277
% 2.15/1.87 # Current number of unprocessed clauses: 266
% 2.15/1.87 # ...number of literals in the above : 1344
% 2.15/1.87 # Current number of archived formulas : 0
% 2.15/1.87 # Current number of archived clauses : 306
% 2.15/1.87 # Clause-clause subsumption calls (NU) : 20674
% 2.15/1.87 # Rec. Clause-clause subsumption calls : 8822
% 2.15/1.87 # Non-unit clause-clause subsumptions : 67
% 2.15/1.87 # Unit Clause-clause subsumption calls : 0
% 2.15/1.87 # Rewrite failures with RHS unbound : 0
% 2.15/1.87 # BW rewrite match attempts : 0
% 2.15/1.87 # BW rewrite match successes : 0
% 2.15/1.87 # Condensation attempts : 0
% 2.15/1.87 # Condensation successes : 0
% 2.15/1.87 # Termbank termtop insertions : 63521
% 2.15/1.87 # Search garbage collected termcells : 39309
% 2.15/1.87
% 2.15/1.87 # -------------------------------------------------
% 2.15/1.87 # User time : 0.087 s
% 2.15/1.87 # System time : 0.051 s
% 2.15/1.87 # Total time : 0.138 s
% 2.15/1.87 # Maximum resident set size: 42772 pages
% 2.15/1.87
% 2.15/1.87 # -------------------------------------------------
% 2.15/1.87 # User time : 0.132 s
% 2.15/1.87 # System time : 0.064 s
% 2.15/1.87 # Total time : 0.196 s
% 2.15/1.87 # Maximum resident set size: 10808 pages
% 2.15/1.87 % E---3.1 exiting
%------------------------------------------------------------------------------