TSTP Solution File: CSR058+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR058+3 : TPTP v8.1.2. Released v3.4.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:31:52 EDT 2024
% Result : Theorem 3.47s 2.55s
% Output : CNFRefutation 3.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 9 ( 3 unt; 0 def)
% Number of atoms : 15 ( 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 : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-3 aty)
% Number of variables : 4 ( 1 sgn 1 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query158,conjecture,
? [X15] :
( mtvisible(c_englishmt)
=> prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),X15) ),
file('/export/starexec/sandbox2/tmp/tmp.zREtBIsy1T/E---3.1_17594.p',query158) ).
fof(ax2_408,axiom,
( mtvisible(c_englishmt)
=> prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),s_terroriststhathasbeenamemberofaterroristorganization) ),
file('/export/starexec/sandbox2/tmp/tmp.zREtBIsy1T/E---3.1_17594.p',ax2_408) ).
fof(c_0_2,negated_conjecture,
~ ? [X15] :
( mtvisible(c_englishmt)
=> prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),X15) ),
inference(assume_negation,[status(cth)],[query158]) ).
fof(c_0_3,plain,
( ~ mtvisible(c_englishmt)
| prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),s_terroriststhathasbeenamemberofaterroristorganization) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_408])]) ).
fof(c_0_4,negated_conjecture,
! [X5993] :
( mtvisible(c_englishmt)
& ~ prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),X5993) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
cnf(c_0_5,plain,
( prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),s_terroriststhathasbeenamemberofaterroristorganization)
| ~ mtvisible(c_englishmt) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
mtvisible(c_englishmt),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
~ prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),X1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]),c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.85/0.87 % Problem : CSR058+3 : TPTP v8.1.2. Released v3.4.0.
% 0.85/0.88 % Command : run_E %s %d THM
% 0.88/1.08 % Computer : n010.cluster.edu
% 0.88/1.08 % Model : x86_64 x86_64
% 0.88/1.08 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.88/1.08 % Memory : 8042.1875MB
% 0.88/1.08 % OS : Linux 3.10.0-693.el7.x86_64
% 0.88/1.08 % CPULimit : 300
% 0.88/1.08 % WCLimit : 300
% 0.88/1.08 % DateTime : Fri May 3 14:19:38 EDT 2024
% 0.88/1.08 % CPUTime :
% 1.74/1.95 Running first-order theorem proving
% 1.74/1.95 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.zREtBIsy1T/E---3.1_17594.p
% 3.47/2.55 # Version: 3.1.0
% 3.47/2.55 # Preprocessing class: FMLLMMSLSSSNFFN.
% 3.47/2.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.47/2.55 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 3.47/2.55 # Starting new_bool_3 with 300s (1) cores
% 3.47/2.55 # Starting new_bool_1 with 300s (1) cores
% 3.47/2.55 # Starting sh5l with 300s (1) cores
% 3.47/2.55 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 17673 completed with status 0
% 3.47/2.55 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 3.47/2.55 # Preprocessing class: FMLLMMSLSSSNFFN.
% 3.47/2.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.47/2.55 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 3.47/2.55 # No SInE strategy applied
% 3.47/2.55 # Search class: FHHNM-SMLM31-MFFFFFNN
% 3.47/2.55 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 3.47/2.55 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 901s (1) cores
% 3.47/2.55 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 151s (1) cores
% 3.47/2.55 # Starting new_bool_3 with 151s (1) cores
% 3.47/2.55 # Starting new_bool_1 with 151s (1) cores
% 3.47/2.55 # Starting sh5l with 146s (1) cores
% 3.47/2.55 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 17684 completed with status 0
% 3.47/2.55 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 3.47/2.55 # Preprocessing class: FMLLMMSLSSSNFFN.
% 3.47/2.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.47/2.55 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 3.47/2.55 # No SInE strategy applied
% 3.47/2.55 # Search class: FHHNM-SMLM31-MFFFFFNN
% 3.47/2.55 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 3.47/2.55 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 901s (1) cores
% 3.47/2.55 # Preprocessing time : 0.103 s
% 3.47/2.55
% 3.47/2.55 # Proof found!
% 3.47/2.55 # SZS status Theorem
% 3.47/2.55 # SZS output start CNFRefutation
% See solution above
% 3.47/2.55 # Parsed axioms : 8006
% 3.47/2.55 # Removed by relevancy pruning/SinE : 0
% 3.47/2.55 # Initial clauses : 8007
% 3.47/2.55 # Removed in clause preprocessing : 0
% 3.47/2.55 # Initial clauses in saturation : 8007
% 3.47/2.55 # Processed clauses : 266
% 3.47/2.55 # ...of these trivial : 8
% 3.47/2.55 # ...subsumed : 22
% 3.47/2.55 # ...remaining for further processing : 235
% 3.47/2.55 # Other redundant clauses eliminated : 0
% 3.47/2.55 # Clauses deleted for lack of memory : 0
% 3.47/2.55 # Backward-subsumed : 0
% 3.47/2.55 # Backward-rewritten : 0
% 3.47/2.55 # Generated clauses : 0
% 3.47/2.55 # ...of the previous two non-redundant : 0
% 3.47/2.55 # ...aggressively subsumed : 0
% 3.47/2.55 # Contextual simplify-reflections : 0
% 3.47/2.55 # Paramodulations : 0
% 3.47/2.55 # Factorizations : 0
% 3.47/2.55 # NegExts : 0
% 3.47/2.55 # Equation resolutions : 0
% 3.47/2.55 # Disequality decompositions : 0
% 3.47/2.55 # Total rewrite steps : 9
% 3.47/2.55 # ...of those cached : 0
% 3.47/2.55 # Propositional unsat checks : 0
% 3.47/2.55 # Propositional check models : 0
% 3.47/2.55 # Propositional check unsatisfiable : 0
% 3.47/2.55 # Propositional clauses : 0
% 3.47/2.55 # Propositional clauses after purity: 0
% 3.47/2.55 # Propositional unsat core size : 0
% 3.47/2.55 # Propositional preprocessing time : 0.000
% 3.47/2.55 # Propositional encoding time : 0.000
% 3.47/2.55 # Propositional solver time : 0.000
% 3.47/2.55 # Success case prop preproc time : 0.000
% 3.47/2.55 # Success case prop encoding time : 0.000
% 3.47/2.55 # Success case prop solver time : 0.000
% 3.47/2.55 # Current number of processed clauses : 235
% 3.47/2.55 # Positive orientable unit clauses : 140
% 3.47/2.55 # Positive unorientable unit clauses: 0
% 3.47/2.55 # Negative unit clauses : 33
% 3.47/2.55 # Non-unit-clauses : 62
% 3.47/2.55 # Current number of unprocessed clauses: 7741
% 3.47/2.55 # ...number of literals in the above : 12685
% 3.47/2.55 # Current number of archived formulas : 0
% 3.47/2.55 # Current number of archived clauses : 0
% 3.47/2.55 # Clause-clause subsumption calls (NU) : 709
% 3.47/2.55 # Rec. Clause-clause subsumption calls : 709
% 3.47/2.55 # Non-unit clause-clause subsumptions : 22
% 3.47/2.55 # Unit Clause-clause subsumption calls : 1195
% 3.47/2.55 # Rewrite failures with RHS unbound : 0
% 3.47/2.55 # BW rewrite match attempts : 1
% 3.47/2.55 # BW rewrite match successes : 0
% 3.47/2.55 # Condensation attempts : 0
% 3.47/2.55 # Condensation successes : 0
% 3.47/2.55 # Termbank termtop insertions : 310693
% 3.47/2.55 # Search garbage collected termcells : 41054
% 3.47/2.55
% 3.47/2.55 # -------------------------------------------------
% 3.47/2.55 # User time : 0.415 s
% 3.47/2.55 # System time : 0.041 s
% 3.47/2.55 # Total time : 0.456 s
% 3.47/2.55 # Maximum resident set size: 22204 pages
% 3.47/2.55
% 3.47/2.55 # -------------------------------------------------
% 3.47/2.55 # User time : 0.936 s
% 3.47/2.55 # System time : 0.122 s
% 3.47/2.55 # Total time : 1.057 s
% 3.47/2.55 # Maximum resident set size: 8068 pages
% 3.47/2.55 % E---3.1 exiting
% 3.47/2.55 % E exiting
%------------------------------------------------------------------------------