TSTP Solution File: SWW950+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWW950+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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.20s 1.38s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 43 ( 18 unt; 0 def)
% Number of atoms : 78 ( 7 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 66 ( 31 ~; 27 |; 2 &)
% ( 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 : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 41 ( 6 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax46,axiom,
! [X2] : constr_xor(X2,constr_ZERO) = X2,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax46) ).
fof(ax47,axiom,
! [X3,X4] : constr_xor(X3,X4) = constr_xor(X4,X3),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax47) ).
fof(ax74,axiom,
! [X30,X31] :
( ( pred_attacker(tuple_T_in_3(X30,constr_h(constr_xor(X30,constr_xor(name_k0x30,name_ki)))))
& pred_attacker(tuple_T_in_1(X31)) )
=> pred_attacker(tuple_T_out_4(name_objective)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax74) ).
fof(ax73,axiom,
! [X29] :
( pred_attacker(tuple_T_in_1(X29))
=> pred_attacker(tuple_T_out_2(constr_h(constr_xor(X29,constr_xor(name_k0x30,name_ki))))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax73) ).
fof(ax58,axiom,
! [X15,X16] :
( ( pred_attacker(X15)
& pred_attacker(X16) )
=> pred_attacker(tuple_T_in_3(X15,X16)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax58) ).
fof(ax57,axiom,
! [X14] :
( pred_attacker(tuple_T_out_2(X14))
=> pred_attacker(X14) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax57) ).
fof(ax53,axiom,
pred_attacker(constr_ZERO),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax53) ).
fof(ax61,axiom,
! [X21] :
( pred_attacker(X21)
=> pred_attacker(tuple_T_in_1(X21)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax61) ).
fof(ax72,axiom,
! [X28] : pred_attacker(name_new0x2Dname(X28)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax72) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co0) ).
fof(ax55,axiom,
! [X12] :
( pred_attacker(tuple_T_out_4(X12))
=> pred_attacker(X12) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax55) ).
fof(c_0_11,plain,
! [X3] : constr_xor(X3,constr_ZERO) = X3,
inference(variable_rename,[status(thm)],[ax46]) ).
fof(c_0_12,plain,
! [X5,X6] : constr_xor(X5,X6) = constr_xor(X6,X5),
inference(variable_rename,[status(thm)],[ax47]) ).
fof(c_0_13,plain,
! [X32,X33] :
( ~ pred_attacker(tuple_T_in_3(X32,constr_h(constr_xor(X32,constr_xor(name_k0x30,name_ki)))))
| ~ pred_attacker(tuple_T_in_1(X33))
| pred_attacker(tuple_T_out_4(name_objective)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax74])])])]) ).
cnf(c_0_14,plain,
constr_xor(X1,constr_ZERO) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
constr_xor(X1,X2) = constr_xor(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X30] :
( ~ pred_attacker(tuple_T_in_1(X30))
| pred_attacker(tuple_T_out_2(constr_h(constr_xor(X30,constr_xor(name_k0x30,name_ki))))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax73])]) ).
cnf(c_0_17,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_1(X1))
| ~ pred_attacker(tuple_T_in_3(X2,constr_h(constr_xor(X2,constr_xor(name_k0x30,name_ki))))) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
constr_xor(constr_ZERO,X1) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_19,plain,
! [X17,X18] :
( ~ pred_attacker(X17)
| ~ pred_attacker(X18)
| pred_attacker(tuple_T_in_3(X17,X18)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])]) ).
fof(c_0_20,plain,
! [X15] :
( ~ pred_attacker(tuple_T_out_2(X15))
| pred_attacker(X15) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
cnf(c_0_21,plain,
( pred_attacker(tuple_T_out_2(constr_h(constr_xor(X1,constr_xor(name_k0x30,name_ki)))))
| ~ pred_attacker(tuple_T_in_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_3(constr_ZERO,constr_h(constr_xor(name_k0x30,name_ki))))
| ~ pred_attacker(tuple_T_in_1(X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( pred_attacker(tuple_T_in_3(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
pred_attacker(constr_ZERO),
inference(split_conjunct,[status(thm)],[ax53]) ).
cnf(c_0_25,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_T_out_2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( pred_attacker(tuple_T_out_2(constr_h(constr_xor(name_k0x30,name_ki))))
| ~ pred_attacker(tuple_T_in_1(constr_ZERO)) ),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_27,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(constr_h(constr_xor(name_k0x30,name_ki)))
| ~ pred_attacker(tuple_T_in_1(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_28,plain,
( pred_attacker(constr_h(constr_xor(name_k0x30,name_ki)))
| ~ pred_attacker(tuple_T_in_1(constr_ZERO)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_29,plain,
! [X22] :
( ~ pred_attacker(X22)
| pred_attacker(tuple_T_in_1(X22)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax61])]) ).
cnf(c_0_30,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_1(constr_ZERO))
| ~ pred_attacker(tuple_T_in_1(X1)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
( pred_attacker(tuple_T_in_1(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_32,plain,
! [X29] : pred_attacker(name_new0x2Dname(X29)),
inference(variable_rename,[status(thm)],[ax72]) ).
fof(c_0_33,negated_conjecture,
~ pred_attacker(name_objective),
inference(assume_negation,[status(cth)],[co0]) ).
fof(c_0_34,plain,
! [X13] :
( ~ pred_attacker(tuple_T_out_4(X13))
| pred_attacker(X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
cnf(c_0_35,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_1(constr_ZERO))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
pred_attacker(name_new0x2Dname(X1)),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_37,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[c_0_33]) ).
cnf(c_0_38,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_T_out_4(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_1(constr_ZERO)) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_41,plain,
~ pred_attacker(tuple_T_in_1(constr_ZERO)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_42,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_31]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWW950+1 : TPTP v8.1.0. Released v7.4.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Sat Jun 4 14:16:47 EDT 2022
% 0.11/0.31 % CPUTime :
% 0.20/1.38 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.20/1.38 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.20/1.38 # Preprocessing time : 0.009 s
% 0.20/1.38
% 0.20/1.38 # Failure: Out of unprocessed clauses!
% 0.20/1.38 # OLD status GaveUp
% 0.20/1.38 # Parsed axioms : 76
% 0.20/1.38 # Removed by relevancy pruning/SinE : 23
% 0.20/1.38 # Initial clauses : 53
% 0.20/1.38 # Removed in clause preprocessing : 0
% 0.20/1.38 # Initial clauses in saturation : 53
% 0.20/1.38 # Processed clauses : 53
% 0.20/1.38 # ...of these trivial : 0
% 0.20/1.38 # ...subsumed : 0
% 0.20/1.38 # ...remaining for further processing : 53
% 0.20/1.38 # Other redundant clauses eliminated : 0
% 0.20/1.38 # Clauses deleted for lack of memory : 0
% 0.20/1.38 # Backward-subsumed : 0
% 0.20/1.38 # Backward-rewritten : 0
% 0.20/1.38 # Generated clauses : 0
% 0.20/1.38 # ...of the previous two non-trivial : 0
% 0.20/1.38 # Contextual simplify-reflections : 0
% 0.20/1.38 # Paramodulations : 0
% 0.20/1.38 # Factorizations : 0
% 0.20/1.38 # Equation resolutions : 0
% 0.20/1.38 # Current number of processed clauses : 53
% 0.20/1.38 # Positive orientable unit clauses : 7
% 0.20/1.38 # Positive unorientable unit clauses: 0
% 0.20/1.38 # Negative unit clauses : 46
% 0.20/1.38 # Non-unit-clauses : 0
% 0.20/1.38 # Current number of unprocessed clauses: 0
% 0.20/1.38 # ...number of literals in the above : 0
% 0.20/1.38 # Current number of archived formulas : 0
% 0.20/1.38 # Current number of archived clauses : 0
% 0.20/1.38 # Clause-clause subsumption calls (NU) : 0
% 0.20/1.38 # Rec. Clause-clause subsumption calls : 0
% 0.20/1.38 # Non-unit clause-clause subsumptions : 0
% 0.20/1.38 # Unit Clause-clause subsumption calls : 1
% 0.20/1.38 # Rewrite failures with RHS unbound : 0
% 0.20/1.38 # BW rewrite match attempts : 0
% 0.20/1.38 # BW rewrite match successes : 0
% 0.20/1.38 # Condensation attempts : 0
% 0.20/1.38 # Condensation successes : 0
% 0.20/1.38 # Termbank termtop insertions : 732
% 0.20/1.38
% 0.20/1.38 # -------------------------------------------------
% 0.20/1.38 # User time : 0.008 s
% 0.20/1.38 # System time : 0.001 s
% 0.20/1.38 # Total time : 0.009 s
% 0.20/1.38 # Maximum resident set size: 2748 pages
% 0.20/1.38 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.20/1.38 # Preprocessing time : 0.009 s
% 0.20/1.38
% 0.20/1.38 # Proof found!
% 0.20/1.38 # SZS status Theorem
% 0.20/1.38 # SZS output start CNFRefutation
% See solution above
% 0.20/1.38 # Proof object total steps : 43
% 0.20/1.38 # Proof object clause steps : 21
% 0.20/1.38 # Proof object formula steps : 22
% 0.20/1.38 # Proof object conjectures : 4
% 0.20/1.38 # Proof object clause conjectures : 1
% 0.20/1.38 # Proof object formula conjectures : 3
% 0.20/1.38 # Proof object initial clauses used : 11
% 0.20/1.38 # Proof object initial formulas used : 11
% 0.20/1.38 # Proof object generating inferences : 10
% 0.20/1.38 # Proof object simplifying inferences : 5
% 0.20/1.38 # Training examples: 0 positive, 0 negative
% 0.20/1.38 # Parsed axioms : 76
% 0.20/1.38 # Removed by relevancy pruning/SinE : 0
% 0.20/1.38 # Initial clauses : 76
% 0.20/1.38 # Removed in clause preprocessing : 0
% 0.20/1.38 # Initial clauses in saturation : 76
% 0.20/1.38 # Processed clauses : 103
% 0.20/1.38 # ...of these trivial : 1
% 0.20/1.38 # ...subsumed : 4
% 0.20/1.38 # ...remaining for further processing : 98
% 0.20/1.38 # Other redundant clauses eliminated : 0
% 0.20/1.38 # Clauses deleted for lack of memory : 0
% 0.20/1.38 # Backward-subsumed : 4
% 0.20/1.38 # Backward-rewritten : 0
% 0.20/1.38 # Generated clauses : 131
% 0.20/1.38 # ...of the previous two non-trivial : 105
% 0.20/1.38 # Contextual simplify-reflections : 1
% 0.20/1.38 # Paramodulations : 131
% 0.20/1.38 # Factorizations : 0
% 0.20/1.38 # Equation resolutions : 0
% 0.20/1.38 # Current number of processed clauses : 94
% 0.20/1.38 # Positive orientable unit clauses : 16
% 0.20/1.38 # Positive unorientable unit clauses: 1
% 0.20/1.38 # Negative unit clauses : 48
% 0.20/1.38 # Non-unit-clauses : 29
% 0.20/1.38 # Current number of unprocessed clauses: 36
% 0.20/1.38 # ...number of literals in the above : 87
% 0.20/1.38 # Current number of archived formulas : 0
% 0.20/1.38 # Current number of archived clauses : 4
% 0.20/1.38 # Clause-clause subsumption calls (NU) : 547
% 0.20/1.38 # Rec. Clause-clause subsumption calls : 529
% 0.20/1.38 # Non-unit clause-clause subsumptions : 9
% 0.20/1.38 # Unit Clause-clause subsumption calls : 71
% 0.20/1.38 # Rewrite failures with RHS unbound : 0
% 0.20/1.38 # BW rewrite match attempts : 15
% 0.20/1.38 # BW rewrite match successes : 10
% 0.20/1.38 # Condensation attempts : 0
% 0.20/1.38 # Condensation successes : 0
% 0.20/1.38 # Termbank termtop insertions : 3169
% 0.20/1.38
% 0.20/1.38 # -------------------------------------------------
% 0.20/1.38 # User time : 0.009 s
% 0.20/1.38 # System time : 0.002 s
% 0.20/1.38 # Total time : 0.011 s
% 0.20/1.38 # Maximum resident set size: 2936 pages
%------------------------------------------------------------------------------