TSTP Solution File: SWW951+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWW951+1 : TPTP v8.2.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:15 EDT 2024
% Result : Theorem 0.20s 0.54s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 43 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 18 ~; 15 |; 1 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 20 ( 7 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax64,axiom,
! [X26,X27] :
( ( pred_attacker(tuple_T_in_3(X26))
& pred_attacker(tuple_T_in_1(X27)) )
=> pred_attacker(tuple_T_out_4(name_objective)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax64) ).
fof(ax49,axiom,
! [X15] :
( pred_attacker(X15)
=> pred_attacker(tuple_T_in_3(X15)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax49) ).
fof(ax51,axiom,
! [X17] :
( pred_attacker(X17)
=> pred_attacker(tuple_T_in_1(X17)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax51) ).
fof(ax60,axiom,
pred_attacker(name_c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax60) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(ax46,axiom,
! [X12] :
( pred_attacker(tuple_T_out_4(X12))
=> pred_attacker(X12) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax46) ).
fof(c_0_6,plain,
! [X30,X31] :
( ~ pred_attacker(tuple_T_in_3(X30))
| ~ pred_attacker(tuple_T_in_1(X31))
| pred_attacker(tuple_T_out_4(name_objective)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax64])])]) ).
fof(c_0_7,plain,
! [X44] :
( ~ pred_attacker(X44)
| pred_attacker(tuple_T_in_3(X44)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax49])])]) ).
cnf(c_0_8,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_3(X1))
| ~ pred_attacker(tuple_T_in_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( pred_attacker(tuple_T_in_3(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X42] :
( ~ pred_attacker(X42)
| pred_attacker(tuple_T_in_1(X42)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax51])])]) ).
cnf(c_0_11,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_1(X1))
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( pred_attacker(tuple_T_in_1(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
pred_attacker(name_c),
inference(split_conjunct,[status(thm)],[ax60]) ).
fof(c_0_15,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co0])]) ).
fof(c_0_16,plain,
! [X41] :
( ~ pred_attacker(tuple_T_out_4(X41))
| pred_attacker(X41) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax46])])]) ).
cnf(c_0_17,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_18,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_nnf,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_T_out_4(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
pred_attacker(tuple_T_out_4(name_objective)),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWW951+1 : TPTP v8.2.0. Released v7.4.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 20:17:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.52 Running first-order theorem proving
% 0.20/0.52 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.20/0.54 # Version: 3.1.0
% 0.20/0.54 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # Starting sh5l with 300s (1) cores
% 0.20/0.54 # sh5l with pid 24972 completed with status 0
% 0.20/0.54 # Result found by sh5l
% 0.20/0.54 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # Starting sh5l with 300s (1) cores
% 0.20/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.54 # Search class: FHUSM-FFMM21-MFFFFFNN
% 0.20/0.54 # partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.20/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.54 # Starting G-E--_100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with 160s (1) cores
% 0.20/0.54 # G-E--_100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 24977 completed with status 0
% 0.20/0.54 # Result found by G-E--_100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.20/0.54 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # Starting sh5l with 300s (1) cores
% 0.20/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.54 # Search class: FHUSM-FFMM21-MFFFFFNN
% 0.20/0.54 # partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.20/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.54 # Starting G-E--_100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with 160s (1) cores
% 0.20/0.54 # Preprocessing time : 0.001 s
% 0.20/0.54 # Presaturation interreduction done
% 0.20/0.54
% 0.20/0.54 # Proof found!
% 0.20/0.54 # SZS status Theorem
% 0.20/0.54 # SZS output start CNFRefutation
% See solution above
% 0.20/0.54 # Parsed axioms : 66
% 0.20/0.54 # Removed by relevancy pruning/SinE : 6
% 0.20/0.54 # Initial clauses : 60
% 0.20/0.54 # Removed in clause preprocessing : 0
% 0.20/0.54 # Initial clauses in saturation : 60
% 0.20/0.54 # Processed clauses : 128
% 0.20/0.54 # ...of these trivial : 1
% 0.20/0.54 # ...subsumed : 2
% 0.20/0.54 # ...remaining for further processing : 125
% 0.20/0.54 # Other redundant clauses eliminated : 0
% 0.20/0.54 # Clauses deleted for lack of memory : 0
% 0.20/0.54 # Backward-subsumed : 3
% 0.20/0.54 # Backward-rewritten : 1
% 0.20/0.54 # Generated clauses : 62
% 0.20/0.54 # ...of the previous two non-redundant : 47
% 0.20/0.54 # ...aggressively subsumed : 0
% 0.20/0.54 # Contextual simplify-reflections : 0
% 0.20/0.54 # Paramodulations : 62
% 0.20/0.54 # Factorizations : 0
% 0.20/0.54 # NegExts : 0
% 0.20/0.54 # Equation resolutions : 0
% 0.20/0.54 # Disequality decompositions : 0
% 0.20/0.54 # Total rewrite steps : 16
% 0.20/0.54 # ...of those cached : 5
% 0.20/0.54 # Propositional unsat checks : 0
% 0.20/0.54 # Propositional check models : 0
% 0.20/0.54 # Propositional check unsatisfiable : 0
% 0.20/0.54 # Propositional clauses : 0
% 0.20/0.54 # Propositional clauses after purity: 0
% 0.20/0.54 # Propositional unsat core size : 0
% 0.20/0.54 # Propositional preprocessing time : 0.000
% 0.20/0.54 # Propositional encoding time : 0.000
% 0.20/0.54 # Propositional solver time : 0.000
% 0.20/0.54 # Success case prop preproc time : 0.000
% 0.20/0.54 # Success case prop encoding time : 0.000
% 0.20/0.54 # Success case prop solver time : 0.000
% 0.20/0.54 # Current number of processed clauses : 61
% 0.20/0.54 # Positive orientable unit clauses : 12
% 0.20/0.54 # Positive unorientable unit clauses: 1
% 0.20/0.54 # Negative unit clauses : 37
% 0.20/0.54 # Non-unit-clauses : 11
% 0.20/0.54 # Current number of unprocessed clauses: 39
% 0.20/0.54 # ...number of literals in the above : 75
% 0.20/0.54 # Current number of archived formulas : 0
% 0.20/0.54 # Current number of archived clauses : 64
% 0.20/0.54 # Clause-clause subsumption calls (NU) : 338
% 0.20/0.54 # Rec. Clause-clause subsumption calls : 328
% 0.20/0.54 # Non-unit clause-clause subsumptions : 5
% 0.20/0.54 # Unit Clause-clause subsumption calls : 11
% 0.20/0.54 # Rewrite failures with RHS unbound : 0
% 0.20/0.54 # BW rewrite match attempts : 13
% 0.20/0.54 # BW rewrite match successes : 13
% 0.20/0.54 # Condensation attempts : 0
% 0.20/0.54 # Condensation successes : 0
% 0.20/0.54 # Termbank termtop insertions : 2224
% 0.20/0.54 # Search garbage collected termcells : 307
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.006 s
% 0.20/0.54 # System time : 0.003 s
% 0.20/0.54 # Total time : 0.009 s
% 0.20/0.54 # Maximum resident set size: 1880 pages
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.007 s
% 0.20/0.54 # System time : 0.005 s
% 0.20/0.54 # Total time : 0.012 s
% 0.20/0.54 # Maximum resident set size: 1744 pages
% 0.20/0.54 % E---3.1 exiting
% 0.20/0.54 % E exiting
%------------------------------------------------------------------------------