TSTP Solution File: CSR058-10 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR058-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 : Unsatisfiable 98.07s 34.98s
% Output : CNFRefutation 98.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 11 RR)
% Number of literals : 17 ( 16 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-4 aty)
% Number of variables : 14 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ax3_16035,axiom,
ifeq4(mtvisible(c_englishmt),true,prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),s_terroriststhatisamemberofagroup),true) = true,
file('/export/starexec/sandbox/tmp/tmp.gt7bLj9So0/E---3.1_920.p',ax3_16035) ).
cnf(query208,negated_conjecture,
mtvisible(c_englishmt) = true,
file('/export/starexec/sandbox/tmp/tmp.gt7bLj9So0/E---3.1_920.p',query208) ).
cnf(ifeq_axiom,axiom,
ifeq4(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/tmp/tmp.gt7bLj9So0/E---3.1_920.p',ifeq_axiom) ).
cnf(query208_1,negated_conjecture,
ifeq3(prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),X1),true,a,b) = b,
file('/export/starexec/sandbox/tmp/tmp.gt7bLj9So0/E---3.1_920.p',query208_1) ).
cnf(goal,negated_conjecture,
a != b,
file('/export/starexec/sandbox/tmp/tmp.gt7bLj9So0/E---3.1_920.p',goal) ).
cnf(ifeq_axiom_001,axiom,
ifeq3(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/tmp/tmp.gt7bLj9So0/E---3.1_920.p',ifeq_axiom_001) ).
cnf(c_0_6,axiom,
ifeq4(mtvisible(c_englishmt),true,prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),s_terroriststhatisamemberofagroup),true) = true,
ax3_16035 ).
cnf(c_0_7,negated_conjecture,
mtvisible(c_englishmt) = true,
query208 ).
cnf(c_0_8,plain,
ifeq4(true,true,prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),s_terroriststhatisamemberofagroup),true) = true,
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
ifeq4(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_10,negated_conjecture,
ifeq3(prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),X1),true,a,b) = b,
query208_1 ).
cnf(c_0_11,plain,
prettystring(f_subcollectionofwithrelationfromtypefn(c_terrorist,c_hasmembers,c_terroristgroup),s_terroriststhatisamemberofagroup) = true,
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
a != b,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_13,negated_conjecture,
ifeq3(true,true,a,b) = b,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,axiom,
ifeq3(X1,X1,X2,X3) = X2,
ifeq_axiom_001 ).
cnf(c_0_15,negated_conjecture,
a != b,
c_0_12 ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 12.48/12.56 % Problem : CSR058-10 : TPTP v8.1.2. Released v7.5.0.
% 12.48/12.57 % Command : run_E %s %d THM
% 12.60/12.77 % Computer : n019.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 15:19:50 EDT 2024
% 12.60/12.77 % CPUTime :
% 25.26/25.47 Running first-order theorem proving
% 25.26/25.47 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.gt7bLj9So0/E---3.1_920.p
% 98.07/34.98 # Version: 3.1.0
% 98.07/34.98 # Preprocessing class: FMLLSMLLSSSNFFN.
% 98.07/34.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 98.07/34.98 # Starting new_bool_3 with 900s (3) cores
% 98.07/34.98 # Starting new_bool_1 with 900s (3) cores
% 98.07/34.98 # Starting sh5l with 300s (1) cores
% 98.07/34.98 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 98.07/34.98 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 1742 completed with status 0
% 98.07/34.98 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 98.07/34.98 # Preprocessing class: FMLLSMLLSSSNFFN.
% 98.07/34.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 98.07/34.98 # Starting new_bool_3 with 900s (3) cores
% 98.07/34.98 # Starting new_bool_1 with 900s (3) cores
% 98.07/34.98 # Starting sh5l with 300s (1) cores
% 98.07/34.98 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 98.07/34.98 # No SInE strategy applied
% 98.07/34.98 # Search class: FUUPM-SMLM31-DFFFFFNN
% 98.07/34.98 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 98.07/34.98 # Starting SAT001_MinMin_p002000_NN with 163s (1) cores
% 98.07/34.98 # SAT001_MinMin_p002000_NN with pid 1757 completed with status 0
% 98.07/34.98 # Result found by SAT001_MinMin_p002000_NN
% 98.07/34.98 # Preprocessing class: FMLLSMLLSSSNFFN.
% 98.07/34.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 98.07/34.98 # Starting new_bool_3 with 900s (3) cores
% 98.07/34.98 # Starting new_bool_1 with 900s (3) cores
% 98.07/34.98 # Starting sh5l with 300s (1) cores
% 98.07/34.98 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 98.07/34.98 # No SInE strategy applied
% 98.07/34.98 # Search class: FUUPM-SMLM31-DFFFFFNN
% 98.07/34.98 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 98.07/34.98 # Starting SAT001_MinMin_p002000_NN with 163s (1) cores
% 98.07/34.98 # Preprocessing time : 0.306 s
% 98.07/34.98 # Presaturation interreduction done
% 98.07/34.98
% 98.07/34.98 # Proof found!
% 98.07/34.98 # SZS status Unsatisfiable
% 98.07/34.98 # SZS output start CNFRefutation
% See solution above
% 98.07/34.98 # Parsed axioms : 44220
% 98.07/34.98 # Removed by relevancy pruning/SinE : 0
% 98.07/34.98 # Initial clauses : 44220
% 98.07/34.98 # Removed in clause preprocessing : 0
% 98.07/34.98 # Initial clauses in saturation : 44220
% 98.07/34.98 # Processed clauses : 55031
% 98.07/34.98 # ...of these trivial : 1546
% 98.07/34.98 # ...subsumed : 0
% 98.07/34.98 # ...remaining for further processing : 53717
% 98.07/34.98 # Other redundant clauses eliminated : 0
% 98.07/34.98 # Clauses deleted for lack of memory : 0
% 98.07/34.98 # Backward-subsumed : 0
% 98.07/34.98 # Backward-rewritten : 51
% 98.07/34.98 # Generated clauses : 242
% 98.07/34.98 # ...of the previous two non-redundant : 22
% 98.07/34.98 # ...aggressively subsumed : 0
% 98.07/34.98 # Contextual simplify-reflections : 0
% 98.07/34.98 # Paramodulations : 242
% 98.07/34.98 # Factorizations : 0
% 98.07/34.98 # NegExts : 0
% 98.07/34.98 # Equation resolutions : 0
% 98.07/34.98 # Disequality decompositions : 0
% 98.07/34.98 # Total rewrite steps : 2749
% 98.07/34.98 # ...of those cached : 1123
% 98.07/34.98 # Propositional unsat checks : 47
% 98.07/34.98 # Propositional check models : 47
% 98.07/34.98 # Propositional check unsatisfiable : 0
% 98.07/34.98 # Propositional clauses : 0
% 98.07/34.98 # Propositional clauses after purity: 0
% 98.07/34.98 # Propositional unsat core size : 0
% 98.07/34.98 # Propositional preprocessing time : 3.418
% 98.07/34.98 # Propositional encoding time : 2.569
% 98.07/34.98 # Propositional solver time : 0.065
% 98.07/34.98 # Success case prop preproc time : 0.000
% 98.07/34.98 # Success case prop encoding time : 0.000
% 98.07/34.98 # Success case prop solver time : 0.000
% 98.07/34.98 # Current number of processed clauses : 11021
% 98.07/34.98 # Positive orientable unit clauses : 11020
% 98.07/34.98 # Positive unorientable unit clauses: 0
% 98.07/34.98 # Negative unit clauses : 1
% 98.07/34.98 # Non-unit-clauses : 0
% 98.07/34.98 # Current number of unprocessed clauses: 31624
% 98.07/34.98 # ...number of literals in the above : 31624
% 98.07/34.98 # Current number of archived formulas : 0
% 98.07/34.98 # Current number of archived clauses : 42696
% 98.07/34.98 # Clause-clause subsumption calls (NU) : 0
% 98.07/34.98 # Rec. Clause-clause subsumption calls : 0
% 98.07/34.98 # Non-unit clause-clause subsumptions : 0
% 98.07/34.98 # Unit Clause-clause subsumption calls : 0
% 98.07/34.98 # Rewrite failures with RHS unbound : 0
% 98.07/34.98 # BW rewrite match attempts : 1918736
% 98.07/34.98 # BW rewrite match successes : 51
% 98.07/34.98 # Condensation attempts : 0
% 98.07/34.98 # Condensation successes : 0
% 98.07/34.98 # Termbank termtop insertions : 5669943
% 98.07/34.98 # Search garbage collected termcells : 2
% 98.07/34.98
% 98.07/34.98 # -------------------------------------------------
% 98.07/34.98 # User time : 8.685 s
% 98.07/34.98 # System time : 0.451 s
% 98.07/34.98 # Total time : 9.136 s
% 98.07/34.98 # Maximum resident set size: 66156 pages
% 98.07/34.98
% 98.07/34.98 # -------------------------------------------------
% 98.07/34.98 # User time : 8.966 s
% 98.07/34.98 # System time : 0.476 s
% 98.07/34.98 # Total time : 9.442 s
% 98.07/34.98 # Maximum resident set size: 30976 pages
% 98.07/34.98 % E---3.1 exiting
% 98.14/34.98 % E exiting
%------------------------------------------------------------------------------