TSTP Solution File: SWW962+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWW962+1 : TPTP v8.2.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : Tue May 21 06:44:19 EDT 2024
% Result : Theorem 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 15 unt; 0 def)
% Number of atoms : 23 ( 7 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 3 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 6 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax84,axiom,
! [X14,X15] : constr_assoc_pair_2_get_0x30_bitstring(tuple_assoc_pair(X14,X15)) = X14,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax84) ).
fof(ax82,axiom,
! [X9,X10,X11] : tuple_assoc_pair(X9,tuple_assoc_pair(X10,X11)) = tuple_assoc_pair(tuple_assoc_pair(X9,X10),X11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax82) ).
fof(ax144,axiom,
! [X96,X97] :
( pred_attacker(tuple_assoc_pair(X96,X97))
=> pred_attacker(X97) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax144) ).
fof(co0,conjecture,
! [X131] : pred_attacker(tuple_2(name_Nb(X131),name_objective)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(ax157,axiom,
pred_attacker(name_c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax157) ).
fof(c_0_5,plain,
! [X172,X173] : constr_assoc_pair_2_get_0x30_bitstring(tuple_assoc_pair(X172,X173)) = X172,
inference(variable_rename,[status(thm)],[ax84]) ).
fof(c_0_6,plain,
! [X163,X164,X165] : tuple_assoc_pair(X163,tuple_assoc_pair(X164,X165)) = tuple_assoc_pair(tuple_assoc_pair(X163,X164),X165),
inference(variable_rename,[status(thm)],[ax82]) ).
fof(c_0_7,plain,
! [X170,X171] :
( ~ pred_attacker(tuple_assoc_pair(X170,X171))
| pred_attacker(X171) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax144])])]) ).
cnf(c_0_8,plain,
constr_assoc_pair_2_get_0x30_bitstring(tuple_assoc_pair(X1,X2)) = X1,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
tuple_assoc_pair(X1,tuple_assoc_pair(X2,X3)) = tuple_assoc_pair(tuple_assoc_pair(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,negated_conjecture,
~ ! [X131] : pred_attacker(tuple_2(name_Nb(X131),name_objective)),
inference(assume_negation,[status(cth)],[co0]) ).
cnf(c_0_11,plain,
( pred_attacker(X2)
| ~ pred_attacker(tuple_assoc_pair(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
tuple_assoc_pair(X1,X2) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_8]) ).
fof(c_0_13,negated_conjecture,
~ pred_attacker(tuple_2(name_Nb(esk1_0),name_objective)),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
cnf(c_0_14,plain,
( pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
pred_attacker(name_c),
inference(split_conjunct,[status(thm)],[ax157]) ).
cnf(c_0_16,negated_conjecture,
~ pred_attacker(tuple_2(name_Nb(esk1_0),name_objective)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
pred_attacker(X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW962+1 : TPTP v8.2.0. Released v7.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n025.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sat May 18 20:15:08 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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/benchmark/theBenchmark.p
% 0.21/0.54 # Version: 3.1.0
% 0.21/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # new_bool_3 with pid 27079 completed with status 0
% 0.21/0.54 # Result found by new_bool_3
% 0.21/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FHUSM-FFMM21-MFFFFFNN
% 0.21/0.54 # partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting G-E--_100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with 160s (1) cores
% 0.21/0.54 # G-E--_100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 27083 completed with status 0
% 0.21/0.54 # Result found by G-E--_100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.21/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FHUSM-FFMM21-MFFFFFNN
% 0.21/0.54 # partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.21/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting G-E--_100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with 160s (1) cores
% 0.21/0.54 # Preprocessing time : 0.005 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Theorem
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 177
% 0.21/0.54 # Removed by relevancy pruning/SinE : 53
% 0.21/0.54 # Initial clauses : 124
% 0.21/0.54 # Removed in clause preprocessing : 0
% 0.21/0.54 # Initial clauses in saturation : 124
% 0.21/0.54 # Processed clauses : 252
% 0.21/0.54 # ...of these trivial : 0
% 0.21/0.54 # ...subsumed : 0
% 0.21/0.54 # ...remaining for further processing : 252
% 0.21/0.54 # Other redundant clauses eliminated : 0
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 25
% 0.21/0.54 # Backward-rewritten : 18
% 0.21/0.54 # Generated clauses : 37
% 0.21/0.54 # ...of the previous two non-redundant : 30
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 0
% 0.21/0.54 # Paramodulations : 37
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 0
% 0.21/0.54 # Disequality decompositions : 0
% 0.21/0.54 # Total rewrite steps : 31
% 0.21/0.54 # ...of those cached : 1
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 85
% 0.21/0.54 # Positive orientable unit clauses : 7
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 78
% 0.21/0.54 # Non-unit-clauses : 0
% 0.21/0.54 # Current number of unprocessed clauses: 26
% 0.21/0.54 # ...number of literals in the above : 51
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 167
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 968
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 932
% 0.21/0.54 # Non-unit clause-clause subsumptions : 25
% 0.21/0.54 # Unit Clause-clause subsumption calls : 904
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 19
% 0.21/0.54 # BW rewrite match successes : 19
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 5118
% 0.21/0.54 # Search garbage collected termcells : 1108
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.024 s
% 0.21/0.54 # System time : 0.004 s
% 0.21/0.54 # Total time : 0.027 s
% 0.21/0.54 # Maximum resident set size: 2276 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.027 s
% 0.21/0.54 # System time : 0.007 s
% 0.21/0.54 # Total time : 0.034 s
% 0.21/0.54 # Maximum resident set size: 1916 pages
% 0.21/0.54 % E---3.1 exiting
% 0.21/0.54 % E exiting
%------------------------------------------------------------------------------