TSTP Solution File: SWW956+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWW956+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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 : 600s
% DateTime : Thu Jul 21 00:11:45 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 36 ( 15 unt; 0 def)
% Number of atoms : 61 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 48 ( 23 ~; 18 |; 1 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 34 ( 1 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax62,axiom,
! [X13,X14] :
( ( pred_attacker(X13)
& pred_attacker(X14) )
=> pred_attacker(constr_dec(X13,X14)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax62) ).
fof(ax55,axiom,
! [X1,X2] : constr_dec(constr_enc(X2,X1),X1) = X2,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax55) ).
fof(ax76,axiom,
! [X26] :
( pred_attacker(tuple_A_out_4(X26))
=> pred_attacker(X26) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax76) ).
fof(ax91,axiom,
! [X43] :
( pred_attacker(tuple_A_in_3(X43))
=> pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(X43,name_Na),name_P_7)))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax91) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co0) ).
fof(ax78,axiom,
! [X28] :
( pred_attacker(tuple_A_out_2(X28))
=> pred_attacker(X28) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax78) ).
fof(ax90,axiom,
pred_attacker(tuple_A_out_2(constr_mod(constr_exp(name_G_8,name_Na),name_P_7))),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax90) ).
fof(ax81,axiom,
! [X33,X34] :
( pred_attacker(tuple_A_out_1(X33,X34))
=> pred_attacker(X34) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax81) ).
fof(ax82,axiom,
! [X35] :
( pred_attacker(X35)
=> pred_attacker(tuple_A_in_3(X35)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax82) ).
fof(ax89,axiom,
pred_attacker(tuple_A_out_1(name_P_7,name_G_8)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax89) ).
fof(c_0_10,plain,
! [X15,X16] :
( ~ pred_attacker(X15)
| ~ pred_attacker(X16)
| pred_attacker(constr_dec(X15,X16)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax62])]) ).
fof(c_0_11,plain,
! [X3,X4] : constr_dec(constr_enc(X4,X3),X3) = X4,
inference(variable_rename,[status(thm)],[ax55]) ).
fof(c_0_12,plain,
! [X27] :
( ~ pred_attacker(tuple_A_out_4(X27))
| pred_attacker(X27) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax76])]) ).
fof(c_0_13,plain,
! [X44] :
( ~ pred_attacker(tuple_A_in_3(X44))
| pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(X44,name_Na),name_P_7)))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax91])]) ).
fof(c_0_14,negated_conjecture,
~ pred_attacker(name_objective),
inference(assume_negation,[status(cth)],[co0]) ).
cnf(c_0_15,plain,
( pred_attacker(constr_dec(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
constr_dec(constr_enc(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_A_out_4(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(X1,name_Na),name_P_7))))
| ~ pred_attacker(tuple_A_in_3(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X29] :
( ~ pred_attacker(tuple_A_out_2(X29))
| pred_attacker(X29) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
cnf(c_0_21,plain,
( pred_attacker(X1)
| ~ pred_attacker(constr_enc(X1,X2))
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( pred_attacker(constr_enc(name_objective,constr_mod(constr_exp(X1,name_Na),name_P_7)))
| ~ pred_attacker(tuple_A_in_3(X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_A_out_2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
pred_attacker(tuple_A_out_2(constr_mod(constr_exp(name_G_8,name_Na),name_P_7))),
inference(split_conjunct,[status(thm)],[ax90]) ).
fof(c_0_26,plain,
! [X35,X36] :
( ~ pred_attacker(tuple_A_out_1(X35,X36))
| pred_attacker(X36) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])]) ).
cnf(c_0_27,plain,
( ~ pred_attacker(constr_mod(constr_exp(X1,name_Na),name_P_7))
| ~ pred_attacker(tuple_A_in_3(X1)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_28,plain,
pred_attacker(constr_mod(constr_exp(name_G_8,name_Na),name_P_7)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_29,plain,
! [X36] :
( ~ pred_attacker(X36)
| pred_attacker(tuple_A_in_3(X36)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])]) ).
cnf(c_0_30,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_A_out_1(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
pred_attacker(tuple_A_out_1(name_P_7,name_G_8)),
inference(split_conjunct,[status(thm)],[ax89]) ).
cnf(c_0_32,plain,
~ pred_attacker(tuple_A_in_3(name_G_8)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( pred_attacker(tuple_A_in_3(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
pred_attacker(name_G_8),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW956+1 : TPTP v8.1.0. Released v7.4.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 4 11:31:47 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.015 s
% 0.23/1.42
% 0.23/1.42 # Failure: Out of unprocessed clauses!
% 0.23/1.42 # OLD status GaveUp
% 0.23/1.42 # Parsed axioms : 94
% 0.23/1.42 # Removed by relevancy pruning/SinE : 32
% 0.23/1.42 # Initial clauses : 62
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 62
% 0.23/1.42 # Processed clauses : 62
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 0
% 0.23/1.42 # ...remaining for further processing : 62
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 0
% 0.23/1.42 # Generated clauses : 0
% 0.23/1.42 # ...of the previous two non-trivial : 0
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 0
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 62
% 0.23/1.42 # Positive orientable unit clauses : 6
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 56
% 0.23/1.42 # Non-unit-clauses : 0
% 0.23/1.42 # Current number of unprocessed clauses: 0
% 0.23/1.42 # ...number of literals in the above : 0
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 0
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 0
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 0
% 0.23/1.42 # Non-unit clause-clause subsumptions : 0
% 0.23/1.42 # Unit Clause-clause subsumption calls : 1
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 0
% 0.23/1.42 # BW rewrite match successes : 0
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 907
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.013 s
% 0.23/1.42 # System time : 0.003 s
% 0.23/1.42 # Total time : 0.015 s
% 0.23/1.42 # Maximum resident set size: 2784 pages
% 0.23/1.42 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.42 # Preprocessing time : 0.016 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 36
% 0.23/1.42 # Proof object clause steps : 17
% 0.23/1.42 # Proof object formula steps : 19
% 0.23/1.42 # Proof object conjectures : 4
% 0.23/1.42 # Proof object clause conjectures : 1
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 10
% 0.23/1.42 # Proof object initial formulas used : 10
% 0.23/1.42 # Proof object generating inferences : 7
% 0.23/1.42 # Proof object simplifying inferences : 3
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 94
% 0.23/1.42 # Removed by relevancy pruning/SinE : 0
% 0.23/1.42 # Initial clauses : 94
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 94
% 0.23/1.42 # Processed clauses : 104
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 1
% 0.23/1.42 # ...remaining for further processing : 103
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 1
% 0.23/1.42 # Backward-rewritten : 0
% 0.23/1.42 # Generated clauses : 60
% 0.23/1.42 # ...of the previous two non-trivial : 48
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 60
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 102
% 0.23/1.42 # Positive orientable unit clauses : 16
% 0.23/1.42 # Positive unorientable unit clauses: 1
% 0.23/1.42 # Negative unit clauses : 57
% 0.23/1.42 # Non-unit-clauses : 28
% 0.23/1.42 # Current number of unprocessed clauses: 38
% 0.23/1.42 # ...number of literals in the above : 99
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 1
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 288
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 285
% 0.23/1.42 # Non-unit clause-clause subsumptions : 2
% 0.23/1.42 # Unit Clause-clause subsumption calls : 267
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 0
% 0.23/1.42 # BW rewrite match successes : 0
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 3231
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.016 s
% 0.23/1.42 # System time : 0.003 s
% 0.23/1.42 # Total time : 0.019 s
% 0.23/1.42 # Maximum resident set size: 2996 pages
%------------------------------------------------------------------------------