TSTP Solution File: CSR032+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR032+4 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:31:26 EDT 2024
% Result : Theorem 31.23s 30.94s
% Output : CNFRefutation 31.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 4 unt; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 5 ~; 2 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 7 ( 1 sgn 3 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query182,conjecture,
? [X24] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),X24) ),
file('/export/starexec/sandbox2/tmp/tmp.2fGPW7chDX/E---3.1_19992.p',query182) ).
fof(ax3_44154,axiom,
! [X16] :
( individual(X16)
=> isa(X16,c_individual) ),
file('/export/starexec/sandbox2/tmp/tmp.2fGPW7chDX/E---3.1_19992.p',ax3_44154) ).
fof(ax3_14987,axiom,
individual(f_citynamedfn(s_agen,c_france)),
file('/export/starexec/sandbox2/tmp/tmp.2fGPW7chDX/E---3.1_19992.p',ax3_14987) ).
fof(c_0_3,negated_conjecture,
~ ? [X24] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),X24) ),
inference(assume_negation,[status(cth)],[query182]) ).
fof(c_0_4,negated_conjecture,
! [X25] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
& ~ isa(f_citynamedfn(s_agen,c_france),X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X75] :
( ~ individual(X75)
| isa(X75,c_individual) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_44154])])]) ).
cnf(c_0_6,negated_conjecture,
~ isa(f_citynamedfn(s_agen,c_france),X1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( isa(X1,c_individual)
| ~ individual(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
individual(f_citynamedfn(s_agen,c_france)),
inference(split_conjunct,[status(thm)],[ax3_14987]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 12.53/12.54 % Problem : CSR032+4 : TPTP v8.1.2. Released v3.4.0.
% 12.54/12.56 % Command : run_E %s %d THM
% 12.60/12.77 % Computer : n020.cluster.edu
% 12.60/12.77 % Model : x86_64 x86_64
% 12.60/12.77 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 12.60/12.77 % Memory : 8042.1875MB
% 12.60/12.77 % OS : Linux 3.10.0-693.el7.x86_64
% 12.60/12.77 % CPULimit : 300
% 12.60/12.77 % WCLimit : 300
% 12.60/12.77 % DateTime : Fri May 3 14:23:05 EDT 2024
% 12.60/12.77 % CPUTime :
% 29.69/29.97 Running first-order theorem proving
% 29.69/29.97 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.2fGPW7chDX/E---3.1_19992.p
% 31.23/30.94 # Version: 3.1.0
% 31.23/30.94 # Preprocessing class: FMLLLMSLSSSNFFN.
% 31.23/30.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 31.23/30.94 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 31.23/30.94 # Starting new_bool_3 with 300s (1) cores
% 31.23/30.94 # Starting new_bool_1 with 300s (1) cores
% 31.23/30.94 # Starting sh5l with 300s (1) cores
% 31.23/30.94 # new_bool_1 with pid 20899 completed with status 0
% 31.23/30.94 # Result found by new_bool_1
% 31.23/30.94 # Preprocessing class: FMLLLMSLSSSNFFN.
% 31.23/30.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 31.23/30.94 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 31.23/30.94 # Starting new_bool_3 with 300s (1) cores
% 31.23/30.94 # Starting new_bool_1 with 300s (1) cores
% 31.23/30.94 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 31.23/30.94 # Search class: FHUNM-FFMM32-SFFFFFNN
% 31.23/30.94 # partial match(1): FHUNM-FFMM22-SFFFFFNN
% 31.23/30.94 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 31.23/30.94 # Starting G-E--_207_C41_F1_AE_CS_SP_PI_S0Y with 181s (1) cores
% 31.23/30.94 # G-E--_207_C41_F1_AE_CS_SP_PI_S0Y with pid 20903 completed with status 0
% 31.23/30.94 # Result found by G-E--_207_C41_F1_AE_CS_SP_PI_S0Y
% 31.23/30.94 # Preprocessing class: FMLLLMSLSSSNFFN.
% 31.23/30.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 31.23/30.94 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 31.23/30.94 # Starting new_bool_3 with 300s (1) cores
% 31.23/30.94 # Starting new_bool_1 with 300s (1) cores
% 31.23/30.94 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 31.23/30.94 # Search class: FHUNM-FFMM32-SFFFFFNN
% 31.23/30.94 # partial match(1): FHUNM-FFMM22-SFFFFFNN
% 31.23/30.94 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 31.23/30.94 # Starting G-E--_207_C41_F1_AE_CS_SP_PI_S0Y with 181s (1) cores
% 31.23/30.94 # Preprocessing time : 0.013 s
% 31.23/30.94
% 31.23/30.94 # Proof found!
% 31.23/30.94 # SZS status Theorem
% 31.23/30.94 # SZS output start CNFRefutation
% See solution above
% 31.23/30.94 # Parsed axioms : 44217
% 31.23/30.94 # Removed by relevancy pruning/SinE : 44152
% 31.23/30.94 # Initial clauses : 66
% 31.23/30.94 # Removed in clause preprocessing : 0
% 31.23/30.94 # Initial clauses in saturation : 66
% 31.23/30.94 # Processed clauses : 24
% 31.23/30.94 # ...of these trivial : 4
% 31.23/30.94 # ...subsumed : 0
% 31.23/30.94 # ...remaining for further processing : 20
% 31.23/30.94 # Other redundant clauses eliminated : 0
% 31.23/30.94 # Clauses deleted for lack of memory : 0
% 31.23/30.94 # Backward-subsumed : 0
% 31.23/30.94 # Backward-rewritten : 0
% 31.23/30.94 # Generated clauses : 2
% 31.23/30.94 # ...of the previous two non-redundant : 0
% 31.23/30.94 # ...aggressively subsumed : 0
% 31.23/30.94 # Contextual simplify-reflections : 0
% 31.23/30.94 # Paramodulations : 2
% 31.23/30.94 # Factorizations : 0
% 31.23/30.94 # NegExts : 0
% 31.23/30.94 # Equation resolutions : 0
% 31.23/30.94 # Disequality decompositions : 0
% 31.23/30.94 # Total rewrite steps : 5
% 31.23/30.94 # ...of those cached : 2
% 31.23/30.94 # Propositional unsat checks : 0
% 31.23/30.94 # Propositional check models : 0
% 31.23/30.94 # Propositional check unsatisfiable : 0
% 31.23/30.94 # Propositional clauses : 0
% 31.23/30.94 # Propositional clauses after purity: 0
% 31.23/30.94 # Propositional unsat core size : 0
% 31.23/30.94 # Propositional preprocessing time : 0.000
% 31.23/30.94 # Propositional encoding time : 0.000
% 31.23/30.94 # Propositional solver time : 0.000
% 31.23/30.94 # Success case prop preproc time : 0.000
% 31.23/30.94 # Success case prop encoding time : 0.000
% 31.23/30.94 # Success case prop solver time : 0.000
% 31.23/30.94 # Current number of processed clauses : 20
% 31.23/30.94 # Positive orientable unit clauses : 11
% 31.23/30.94 # Positive unorientable unit clauses: 0
% 31.23/30.94 # Negative unit clauses : 2
% 31.23/30.94 # Non-unit-clauses : 7
% 31.23/30.94 # Current number of unprocessed clauses: 42
% 31.23/30.94 # ...number of literals in the above : 60
% 31.23/30.94 # Current number of archived formulas : 0
% 31.23/30.94 # Current number of archived clauses : 0
% 31.23/30.94 # Clause-clause subsumption calls (NU) : 13
% 31.23/30.94 # Rec. Clause-clause subsumption calls : 8
% 31.23/30.94 # Non-unit clause-clause subsumptions : 0
% 31.23/30.94 # Unit Clause-clause subsumption calls : 4
% 31.23/30.94 # Rewrite failures with RHS unbound : 0
% 31.23/30.94 # BW rewrite match attempts : 0
% 31.23/30.94 # BW rewrite match successes : 0
% 31.23/30.94 # Condensation attempts : 0
% 31.23/30.94 # Condensation successes : 0
% 31.23/30.94 # Termbank termtop insertions : 293909
% 31.23/30.94 # Search garbage collected termcells : 157610
% 31.23/30.94
% 31.23/30.94 # -------------------------------------------------
% 31.23/30.94 # User time : 0.153 s
% 31.23/30.94 # System time : 0.058 s
% 31.23/30.94 # Total time : 0.211 s
% 31.23/30.94 # Maximum resident set size: 81764 pages
% 31.23/30.94
% 31.23/30.94 # -------------------------------------------------
% 31.23/30.94 # User time : 0.842 s
% 31.23/30.94 # System time : 0.097 s
% 31.23/30.94 # Total time : 0.939 s
% 31.23/30.94 # Maximum resident set size: 34600 pages
% 31.23/30.94 % E---3.1 exiting
% 31.23/30.94 % E exiting
%------------------------------------------------------------------------------