TSTP Solution File: CSR114+21 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR114+21 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 : Mon May 20 19:15:55 EDT 2024
% Result : Theorem 0.95s 0.66s
% Output : CNFRefutation 0.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 11 unt; 0 def)
% Number of atoms : 155 ( 0 equ)
% Maximal formula atoms : 74 ( 6 avg)
% Number of connectives : 173 ( 43 ~; 36 |; 93 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 74 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-2 aty)
% Number of functors : 29 ( 29 usr; 28 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn 9 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_004_qapn_68,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/benchmark/theBenchmark.p',synth_qa07_004_qapn_68) ).
fof(ave07_era5_synth_qa07_004_qapn_68,hypothesis,
( attr(c12,c13)
& sub(c12,stadt__1_1)
& sub(c13,name_1_1)
& val(c13,rom_0)
& aff(c19,c5)
& subs(c19,restaurieren_1_1)
& in(c30,c12)
& loc(c5,c30)
& sub(c5,kolosseum_1_1)
& sort(c12,d)
& sort(c12,io)
& card(c12,int1)
& etype(c12,int0)
& fact(c12,real)
& gener(c12,sp)
& quant(c12,one)
& refer(c12,det)
& varia(c12,con)
& sort(c13,na)
& card(c13,int1)
& etype(c13,int0)
& fact(c13,real)
& gener(c13,sp)
& quant(c13,one)
& refer(c13,indet)
& varia(c13,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(c19,da)
& fact(c19,real)
& gener(c19,sp)
& sort(c5,d)
& card(c5,int1)
& etype(c5,int0)
& fact(c5,real)
& gener(c5,sp)
& quant(c5,one)
& refer(c5,det)
& varia(c5,con)
& sort(restaurieren_1_1,da)
& fact(restaurieren_1_1,real)
& gener(restaurieren_1_1,ge)
& sort(c30,l)
& card(c30,int1)
& etype(c30,int0)
& fact(c30,real)
& gener(c30,sp)
& quant(c30,one)
& refer(c30,det)
& varia(c30,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) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ave07_era5_synth_qa07_004_qapn_68) ).
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/benchmark/Axioms/CSR004+0.ax',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_68]) ).
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(c13,rom_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_68]) ).
cnf(c_0_7,hypothesis,
sub(c13,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_68]) ).
cnf(c_0_8,hypothesis,
( ~ in(X1,X2)
| ~ attr(X2,c13)
| ~ 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(c12,c13),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_68]) ).
cnf(c_0_10,hypothesis,
sub(c12,stadt__1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_68]) ).
fof(c_0_11,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_12,hypothesis,
( ~ in(X1,c12)
| ~ 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_13,hypothesis,
in(c30,c12),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_68]) ).
cnf(c_0_14,plain,
( loc(esk3_2(X1,X2),X2)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,hypothesis,
loc(c5,c30),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_68]) ).
cnf(c_0_16,plain,
( subs(esk3_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,hypothesis,
( ~ scar(X1,X2)
| ~ loc(X1,c30)
| ~ subs(X1,stehen_1_1)
| ~ sub(X2,kolosseum_1_1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,hypothesis,
loc(esk3_2(c5,c30),c30),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,hypothesis,
subs(esk3_2(c5,c30),stehen_1_1),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_20,plain,
( scar(esk3_2(X1,X2),X1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,hypothesis,
( ~ scar(esk3_2(c5,c30),X1)
| ~ sub(X1,kolosseum_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,hypothesis,
sub(c5,kolosseum_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_qapn_68]) ).
cnf(c_0_23,hypothesis,
scar(esk3_2(c5,c30),c5),
inference(spm,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_24,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : CSR114+21 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n028.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Sun May 19 00:38:38 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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/benchmark/theBenchmark.p
% 0.95/0.66 # Version: 3.1.0
% 0.95/0.66 # Preprocessing class: FMLLSMSLSSSNFFN.
% 0.95/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.95/0.66 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.95/0.66 # Starting new_bool_3 with 300s (1) cores
% 0.95/0.66 # Starting new_bool_1 with 300s (1) cores
% 0.95/0.66 # Starting sh5l with 300s (1) cores
% 0.95/0.66 # new_bool_1 with pid 6060 completed with status 0
% 0.95/0.66 # Result found by new_bool_1
% 0.95/0.66 # Preprocessing class: FMLLSMSLSSSNFFN.
% 0.95/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.95/0.66 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.95/0.66 # Starting new_bool_3 with 300s (1) cores
% 0.95/0.66 # Starting new_bool_1 with 300s (1) cores
% 0.95/0.66 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.95/0.66 # Search class: FHHNF-FFMM32-SFFFFFNN
% 0.95/0.66 # partial match(1): FGHNF-FFMM32-SFFFFFNN
% 0.95/0.66 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.95/0.66 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 181s (1) cores
% 0.95/0.66 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 6062 completed with status 0
% 0.95/0.66 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.95/0.66 # Preprocessing class: FMLLSMSLSSSNFFN.
% 0.95/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.95/0.66 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.95/0.66 # Starting new_bool_3 with 300s (1) cores
% 0.95/0.66 # Starting new_bool_1 with 300s (1) cores
% 0.95/0.66 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.95/0.66 # Search class: FHHNF-FFMM32-SFFFFFNN
% 0.95/0.66 # partial match(1): FGHNF-FFMM32-SFFFFFNN
% 0.95/0.66 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.95/0.66 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 181s (1) cores
% 0.95/0.66 # Preprocessing time : 0.009 s
% 0.95/0.66 # Presaturation interreduction done
% 0.95/0.66
% 0.95/0.66 # Proof found!
% 0.95/0.66 # SZS status Theorem
% 0.95/0.66 # SZS output start CNFRefutation
% See solution above
% 0.95/0.66 # Parsed axioms : 10189
% 0.95/0.66 # Removed by relevancy pruning/SinE : 10136
% 0.95/0.66 # Initial clauses : 144
% 0.95/0.66 # Removed in clause preprocessing : 0
% 0.95/0.66 # Initial clauses in saturation : 144
% 0.95/0.66 # Processed clauses : 360
% 0.95/0.66 # ...of these trivial : 0
% 0.95/0.66 # ...subsumed : 0
% 0.95/0.66 # ...remaining for further processing : 360
% 0.95/0.66 # Other redundant clauses eliminated : 0
% 0.95/0.66 # Clauses deleted for lack of memory : 0
% 0.95/0.66 # Backward-subsumed : 0
% 0.95/0.66 # Backward-rewritten : 0
% 0.95/0.66 # Generated clauses : 98
% 0.95/0.66 # ...of the previous two non-redundant : 97
% 0.95/0.66 # ...aggressively subsumed : 0
% 0.95/0.66 # Contextual simplify-reflections : 0
% 0.95/0.66 # Paramodulations : 98
% 0.95/0.66 # Factorizations : 0
% 0.95/0.66 # NegExts : 0
% 0.95/0.66 # Equation resolutions : 0
% 0.95/0.66 # Disequality decompositions : 0
% 0.95/0.66 # Total rewrite steps : 4
% 0.95/0.66 # ...of those cached : 0
% 0.95/0.66 # Propositional unsat checks : 0
% 0.95/0.66 # Propositional check models : 0
% 0.95/0.66 # Propositional check unsatisfiable : 0
% 0.95/0.66 # Propositional clauses : 0
% 0.95/0.66 # Propositional clauses after purity: 0
% 0.95/0.66 # Propositional unsat core size : 0
% 0.95/0.66 # Propositional preprocessing time : 0.000
% 0.95/0.66 # Propositional encoding time : 0.000
% 0.95/0.66 # Propositional solver time : 0.000
% 0.95/0.66 # Success case prop preproc time : 0.000
% 0.95/0.66 # Success case prop encoding time : 0.000
% 0.95/0.66 # Success case prop solver time : 0.000
% 0.95/0.66 # Current number of processed clauses : 216
% 0.95/0.66 # Positive orientable unit clauses : 155
% 0.95/0.66 # Positive unorientable unit clauses: 0
% 0.95/0.66 # Negative unit clauses : 0
% 0.95/0.66 # Non-unit-clauses : 61
% 0.95/0.66 # Current number of unprocessed clauses: 25
% 0.95/0.66 # ...number of literals in the above : 74
% 0.95/0.66 # Current number of archived formulas : 0
% 0.95/0.66 # Current number of archived clauses : 144
% 0.95/0.66 # Clause-clause subsumption calls (NU) : 1852
% 0.95/0.66 # Rec. Clause-clause subsumption calls : 879
% 0.95/0.66 # Non-unit clause-clause subsumptions : 0
% 0.95/0.66 # Unit Clause-clause subsumption calls : 186
% 0.95/0.66 # Rewrite failures with RHS unbound : 0
% 0.95/0.66 # BW rewrite match attempts : 0
% 0.95/0.66 # BW rewrite match successes : 0
% 0.95/0.66 # Condensation attempts : 0
% 0.95/0.66 # Condensation successes : 0
% 0.95/0.66 # Termbank termtop insertions : 49895
% 0.95/0.66 # Search garbage collected termcells : 39030
% 0.95/0.66
% 0.95/0.66 # -------------------------------------------------
% 0.95/0.66 # User time : 0.049 s
% 0.95/0.66 # System time : 0.045 s
% 0.95/0.66 # Total time : 0.095 s
% 0.95/0.66 # Maximum resident set size: 42320 pages
% 0.95/0.66
% 0.95/0.66 # -------------------------------------------------
% 0.95/0.66 # User time : 0.108 s
% 0.95/0.66 # System time : 0.060 s
% 0.95/0.66 # Total time : 0.169 s
% 0.95/0.66 # Maximum resident set size: 10616 pages
% 0.95/0.66 % E---3.1 exiting
% 0.95/0.66 % E exiting
%------------------------------------------------------------------------------