TSTP Solution File: SWW948+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWW948+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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:44 EDT 2022
% Result : Theorem 0.28s 1.45s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of formulae : 63 ( 31 unt; 0 def)
% Number of atoms : 109 ( 14 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 86 ( 40 ~; 36 |; 2 &)
% ( 0 <=>; 8 =>; 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 : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 74 ( 2 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax106,axiom,
! [X40] :
( pred_attacker(tuple_R_in_2(X40,constr_h(constr_xor(constr_xor(name_r0x30,X40),name_k))))
=> pred_attacker(tuple_R_out_4(name_objective_R)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax106) ).
fof(ax68,axiom,
! [X3,X4] : constr_xor(X3,X4) = constr_xor(X4,X3),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax68) ).
fof(ax67,axiom,
! [X2] : constr_xor(X2,constr_ZERO) = X2,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax67) ).
fof(ax88,axiom,
! [X27,X28] :
( ( pred_attacker(X27)
& pred_attacker(X28) )
=> pred_attacker(tuple_R_in_2(X27,X28)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax88) ).
fof(ax69,axiom,
! [X5,X6,X7] : constr_xor(X5,constr_xor(X6,X7)) = constr_xor(constr_xor(X5,X6),X7),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax69) ).
fof(ax66,axiom,
! [X1] : constr_xor(X1,X1) = constr_ZERO,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax66) ).
fof(ax76,axiom,
! [X16,X17] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X16,X17))
=> pred_attacker(X17) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax76) ).
fof(ax102,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(constr_xor(name_r0x30_from_1st,name_r1_from_1st),name_k)))),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax102) ).
fof(ax70,axiom,
! [X8,X9] :
( ( pred_attacker(X8)
& pred_attacker(X9) )
=> pred_attacker(constr_xor(X8,X9)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax70) ).
fof(co0,conjecture,
pred_attacker(name_objective_R),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co0) ).
fof(ax83,axiom,
! [X22] :
( pred_attacker(tuple_R_out_4(X22))
=> pred_attacker(X22) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax83) ).
fof(ax78,axiom,
! [X19] :
( pred_attacker(tuple_knowledge_from_1st_round_out_1(X19))
=> pred_attacker(X19) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax78) ).
fof(ax87,axiom,
! [X26] :
( pred_attacker(tuple_R_out_1(X26))
=> pred_attacker(X26) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax87) ).
fof(ax75,axiom,
! [X14,X15] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X14,X15))
=> pred_attacker(X14) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax75) ).
fof(ax101,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r0x30_from_1st)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax101) ).
fof(ax104,axiom,
pred_attacker(tuple_R_out_1(name_r0x30)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax104) ).
fof(c_0_16,plain,
! [X41] :
( ~ pred_attacker(tuple_R_in_2(X41,constr_h(constr_xor(constr_xor(name_r0x30,X41),name_k))))
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax106])])])]) ).
fof(c_0_17,plain,
! [X5,X6] : constr_xor(X5,X6) = constr_xor(X6,X5),
inference(variable_rename,[status(thm)],[ax68]) ).
fof(c_0_18,plain,
! [X3] : constr_xor(X3,constr_ZERO) = X3,
inference(variable_rename,[status(thm)],[ax67]) ).
cnf(c_0_19,plain,
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(tuple_R_in_2(X1,constr_h(constr_xor(constr_xor(name_r0x30,X1),name_k)))) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
constr_xor(X1,X2) = constr_xor(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_21,plain,
! [X29,X30] :
( ~ pred_attacker(X29)
| ~ pred_attacker(X30)
| pred_attacker(tuple_R_in_2(X29,X30)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax88])]) ).
fof(c_0_22,plain,
! [X8,X9,X10] : constr_xor(X8,constr_xor(X9,X10)) = constr_xor(constr_xor(X8,X9),X10),
inference(variable_rename,[status(thm)],[ax69]) ).
fof(c_0_23,plain,
! [X2] : constr_xor(X2,X2) = constr_ZERO,
inference(variable_rename,[status(thm)],[ax66]) ).
cnf(c_0_24,plain,
constr_xor(X1,constr_ZERO) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(tuple_R_in_2(X1,constr_h(constr_xor(name_k,constr_xor(name_r0x30,X1))))) ),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( pred_attacker(tuple_R_in_2(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
constr_xor(X1,constr_xor(X2,X3)) = constr_xor(constr_xor(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
constr_xor(X1,X1) = constr_ZERO,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
constr_xor(constr_ZERO,X1) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_20]) ).
fof(c_0_30,plain,
! [X18,X19] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X18,X19))
| pred_attacker(X19) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax76])]) ).
cnf(c_0_31,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(constr_xor(name_r0x30_from_1st,name_r1_from_1st),name_k)))),
inference(split_conjunct,[status(thm)],[ax102]) ).
fof(c_0_32,plain,
! [X10,X11] :
( ~ pred_attacker(X10)
| ~ pred_attacker(X11)
| pred_attacker(constr_xor(X10,X11)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax70])]) ).
cnf(c_0_33,plain,
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(constr_h(constr_xor(name_k,constr_xor(name_r0x30,X1))))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,plain,
constr_xor(X1,constr_xor(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_35,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(name_k,constr_xor(name_r0x30_from_1st,name_r1_from_1st))))),
inference(rw,[status(thm)],[c_0_31,c_0_20]) ).
fof(c_0_37,negated_conjecture,
~ pred_attacker(name_objective_R),
inference(assume_negation,[status(cth)],[co0]) ).
cnf(c_0_38,plain,
( pred_attacker(constr_xor(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_39,plain,
! [X23] :
( ~ pred_attacker(tuple_R_out_4(X23))
| pred_attacker(X23) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])]) ).
cnf(c_0_40,plain,
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(constr_h(constr_xor(name_k,X1)))
| ~ pred_attacker(constr_xor(name_r0x30,X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
pred_attacker(constr_h(constr_xor(name_k,constr_xor(name_r0x30_from_1st,name_r1_from_1st)))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
fof(c_0_42,negated_conjecture,
~ pred_attacker(name_objective_R),
inference(fof_simplification,[status(thm)],[c_0_37]) ).
cnf(c_0_43,plain,
( pred_attacker(X1)
| ~ pred_attacker(constr_xor(X2,X1))
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_34]) ).
cnf(c_0_44,plain,
( pred_attacker(constr_xor(X1,constr_xor(X2,X3)))
| ~ pred_attacker(constr_xor(X1,X2))
| ~ pred_attacker(X3) ),
inference(spm,[status(thm)],[c_0_38,c_0_27]) ).
fof(c_0_45,plain,
! [X20] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X20))
| pred_attacker(X20) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
fof(c_0_46,plain,
! [X27] :
( ~ pred_attacker(tuple_R_out_1(X27))
| pred_attacker(X27) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax87])]) ).
fof(c_0_47,plain,
! [X16,X17] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X16,X17))
| pred_attacker(X16) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax75])])])]) ).
cnf(c_0_48,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_R_out_4(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_49,plain,
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(constr_xor(name_r0x30,constr_xor(name_r0x30_from_1st,name_r1_from_1st))) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_50,negated_conjecture,
~ pred_attacker(name_objective_R),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_51,plain,
( pred_attacker(constr_xor(X1,X2))
| ~ pred_attacker(constr_xor(X3,X1))
| ~ pred_attacker(X3)
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_52,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_53,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r0x30_from_1st)),
inference(split_conjunct,[status(thm)],[ax101]) ).
cnf(c_0_54,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_R_out_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_55,plain,
pred_attacker(tuple_R_out_1(name_r0x30)),
inference(split_conjunct,[status(thm)],[ax104]) ).
cnf(c_0_56,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_57,plain,
~ pred_attacker(constr_xor(name_r0x30,constr_xor(name_r0x30_from_1st,name_r1_from_1st))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]) ).
cnf(c_0_58,plain,
( pred_attacker(constr_xor(X1,constr_xor(X2,X3)))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1)
| ~ pred_attacker(X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_34]),c_0_27]) ).
cnf(c_0_59,plain,
pred_attacker(name_r0x30_from_1st),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
pred_attacker(name_r0x30),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_61,plain,
pred_attacker(name_r1_from_1st),
inference(spm,[status(thm)],[c_0_56,c_0_36]) ).
cnf(c_0_62,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_60]),c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SWW948+1 : TPTP v8.1.0. Released v7.4.0.
% 0.04/0.14 % Command : run_ET %s %d
% 0.15/0.36 % Computer : n017.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sun Jun 5 12:15:00 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.28/1.45 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.28/1.45 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.28/1.45 # Preprocessing time : 0.015 s
% 0.28/1.45
% 0.28/1.45 # Failure: Out of unprocessed clauses!
% 0.28/1.45 # OLD status GaveUp
% 0.28/1.45 # Parsed axioms : 108
% 0.28/1.45 # Removed by relevancy pruning/SinE : 34
% 0.28/1.45 # Initial clauses : 74
% 0.28/1.45 # Removed in clause preprocessing : 0
% 0.28/1.45 # Initial clauses in saturation : 74
% 0.28/1.45 # Processed clauses : 74
% 0.28/1.45 # ...of these trivial : 0
% 0.28/1.45 # ...subsumed : 0
% 0.28/1.45 # ...remaining for further processing : 74
% 0.28/1.45 # Other redundant clauses eliminated : 0
% 0.28/1.45 # Clauses deleted for lack of memory : 0
% 0.28/1.45 # Backward-subsumed : 0
% 0.28/1.45 # Backward-rewritten : 0
% 0.28/1.45 # Generated clauses : 0
% 0.28/1.45 # ...of the previous two non-trivial : 0
% 0.28/1.45 # Contextual simplify-reflections : 0
% 0.28/1.45 # Paramodulations : 0
% 0.28/1.45 # Factorizations : 0
% 0.28/1.45 # Equation resolutions : 0
% 0.28/1.45 # Current number of processed clauses : 74
% 0.28/1.45 # Positive orientable unit clauses : 7
% 0.28/1.45 # Positive unorientable unit clauses: 0
% 0.28/1.45 # Negative unit clauses : 67
% 0.28/1.45 # Non-unit-clauses : 0
% 0.28/1.45 # Current number of unprocessed clauses: 0
% 0.28/1.45 # ...number of literals in the above : 0
% 0.28/1.45 # Current number of archived formulas : 0
% 0.28/1.45 # Current number of archived clauses : 0
% 0.28/1.45 # Clause-clause subsumption calls (NU) : 0
% 0.28/1.45 # Rec. Clause-clause subsumption calls : 0
% 0.28/1.45 # Non-unit clause-clause subsumptions : 0
% 0.28/1.45 # Unit Clause-clause subsumption calls : 1
% 0.28/1.45 # Rewrite failures with RHS unbound : 0
% 0.28/1.45 # BW rewrite match attempts : 0
% 0.28/1.45 # BW rewrite match successes : 0
% 0.28/1.45 # Condensation attempts : 0
% 0.28/1.45 # Condensation successes : 0
% 0.28/1.45 # Termbank termtop insertions : 1034
% 0.28/1.45
% 0.28/1.45 # -------------------------------------------------
% 0.28/1.45 # User time : 0.012 s
% 0.28/1.45 # System time : 0.004 s
% 0.28/1.45 # Total time : 0.016 s
% 0.28/1.45 # Maximum resident set size: 2812 pages
% 0.28/1.45 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.28/1.45 # Preprocessing time : 0.018 s
% 0.28/1.45
% 0.28/1.45 # Proof found!
% 0.28/1.45 # SZS status Theorem
% 0.28/1.45 # SZS output start CNFRefutation
% See solution above
% 0.28/1.45 # Proof object total steps : 63
% 0.28/1.45 # Proof object clause steps : 33
% 0.28/1.45 # Proof object formula steps : 30
% 0.28/1.45 # Proof object conjectures : 4
% 0.28/1.45 # Proof object clause conjectures : 1
% 0.28/1.45 # Proof object formula conjectures : 3
% 0.28/1.45 # Proof object initial clauses used : 16
% 0.28/1.45 # Proof object initial formulas used : 16
% 0.28/1.45 # Proof object generating inferences : 15
% 0.28/1.45 # Proof object simplifying inferences : 9
% 0.28/1.45 # Training examples: 0 positive, 0 negative
% 0.28/1.45 # Parsed axioms : 108
% 0.28/1.45 # Removed by relevancy pruning/SinE : 0
% 0.28/1.45 # Initial clauses : 108
% 0.28/1.45 # Removed in clause preprocessing : 0
% 0.28/1.45 # Initial clauses in saturation : 108
% 0.28/1.45 # Processed clauses : 326
% 0.28/1.45 # ...of these trivial : 3
% 0.28/1.45 # ...subsumed : 146
% 0.28/1.45 # ...remaining for further processing : 177
% 0.28/1.45 # Other redundant clauses eliminated : 0
% 0.28/1.45 # Clauses deleted for lack of memory : 0
% 0.28/1.45 # Backward-subsumed : 0
% 0.28/1.45 # Backward-rewritten : 14
% 0.28/1.45 # Generated clauses : 670
% 0.28/1.45 # ...of the previous two non-trivial : 559
% 0.28/1.45 # Contextual simplify-reflections : 10
% 0.28/1.45 # Paramodulations : 670
% 0.28/1.45 # Factorizations : 0
% 0.28/1.45 # Equation resolutions : 0
% 0.28/1.45 # Current number of processed clauses : 163
% 0.28/1.45 # Positive orientable unit clauses : 27
% 0.28/1.45 # Positive unorientable unit clauses: 3
% 0.28/1.45 # Negative unit clauses : 72
% 0.28/1.45 # Non-unit-clauses : 61
% 0.28/1.45 # Current number of unprocessed clauses: 315
% 0.28/1.45 # ...number of literals in the above : 814
% 0.28/1.45 # Current number of archived formulas : 0
% 0.28/1.45 # Current number of archived clauses : 14
% 0.28/1.45 # Clause-clause subsumption calls (NU) : 5750
% 0.28/1.45 # Rec. Clause-clause subsumption calls : 5498
% 0.28/1.45 # Non-unit clause-clause subsumptions : 98
% 0.28/1.45 # Unit Clause-clause subsumption calls : 994
% 0.28/1.45 # Rewrite failures with RHS unbound : 0
% 0.28/1.45 # BW rewrite match attempts : 99
% 0.28/1.45 # BW rewrite match successes : 71
% 0.28/1.45 # Condensation attempts : 0
% 0.28/1.45 # Condensation successes : 0
% 0.28/1.45 # Termbank termtop insertions : 9795
% 0.28/1.45
% 0.28/1.45 # -------------------------------------------------
% 0.28/1.45 # User time : 0.030 s
% 0.28/1.45 # System time : 0.005 s
% 0.28/1.45 # Total time : 0.035 s
% 0.28/1.45 # Maximum resident set size: 3532 pages
%------------------------------------------------------------------------------