TSTP Solution File: SWW955+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWW955+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n022.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.25s 1.42s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 46 ( 20 unt; 0 def)
% Number of atoms : 76 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 56 ( 26 ~; 22 |; 1 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-2 aty)
% Number of variables : 45 ( 3 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax79,axiom,
! [X34] :
( pred_attacker(tuple_A_in_2(X34))
=> pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax79) ).
fof(ax70,axiom,
! [X25] :
( pred_attacker(X25)
=> pred_attacker(tuple_A_in_2(X25)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax70) ).
fof(ax78,axiom,
! [X33] :
( pred_attacker(tuple_A_in_2(X33))
=> pred_attacker(tuple_A_out_3(constr_comm_dec(X33,name_Ka))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax78) ).
fof(ax46,axiom,
! [X3,X4] : constr_comm_dec(constr_comm_enc(X4,X3),X3) = X4,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax46) ).
fof(ax76,axiom,
! [X32] : pred_attacker(name_new0x2Dname(X32)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax76) ).
fof(ax50,axiom,
! [X7,X8] :
( ( pred_attacker(X7)
& pred_attacker(X8) )
=> pred_attacker(constr_dec(X7,X8)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax50) ).
fof(ax45,axiom,
! [X1,X2] : constr_dec(constr_enc(X2,X1),X1) = X2,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax45) ).
fof(ax65,axiom,
! [X20] :
( pred_attacker(tuple_A_out_4(X20))
=> pred_attacker(X20) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax65) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co0) ).
fof(ax67,axiom,
! [X22] :
( pred_attacker(tuple_A_out_3(X22))
=> pred_attacker(X22) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax67) ).
fof(ax69,axiom,
! [X24] :
( pred_attacker(tuple_A_out_1(X24))
=> pred_attacker(X24) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax69) ).
fof(ax77,axiom,
pred_attacker(tuple_A_out_1(constr_comm_enc(name_m_9,name_Ka))),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax77) ).
fof(c_0_12,plain,
! [X35] :
( ~ pred_attacker(tuple_A_in_2(X35))
| pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax79])])])]) ).
fof(c_0_13,plain,
! [X26] :
( ~ pred_attacker(X26)
| pred_attacker(tuple_A_in_2(X26)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax70])]) ).
fof(c_0_14,plain,
! [X34] :
( ~ pred_attacker(tuple_A_in_2(X34))
| pred_attacker(tuple_A_out_3(constr_comm_dec(X34,name_Ka))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
fof(c_0_15,plain,
! [X5,X6] : constr_comm_dec(constr_comm_enc(X6,X5),X5) = X6,
inference(variable_rename,[status(thm)],[ax46]) ).
cnf(c_0_16,plain,
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9)))
| ~ pred_attacker(tuple_A_in_2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( pred_attacker(tuple_A_in_2(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X33] : pred_attacker(name_new0x2Dname(X33)),
inference(variable_rename,[status(thm)],[ax76]) ).
cnf(c_0_19,plain,
( pred_attacker(tuple_A_out_3(constr_comm_dec(X1,name_Ka)))
| ~ pred_attacker(tuple_A_in_2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
constr_comm_dec(constr_comm_enc(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X9,X10] :
( ~ pred_attacker(X9)
| ~ pred_attacker(X10)
| pred_attacker(constr_dec(X9,X10)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax50])]) ).
fof(c_0_22,plain,
! [X3,X4] : constr_dec(constr_enc(X4,X3),X3) = X4,
inference(variable_rename,[status(thm)],[ax45]) ).
fof(c_0_23,plain,
! [X21] :
( ~ pred_attacker(tuple_A_out_4(X21))
| pred_attacker(X21) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax65])]) ).
cnf(c_0_24,plain,
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9)))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_25,plain,
pred_attacker(name_new0x2Dname(X1)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_26,negated_conjecture,
~ pred_attacker(name_objective),
inference(assume_negation,[status(cth)],[co0]) ).
fof(c_0_27,plain,
! [X23] :
( ~ pred_attacker(tuple_A_out_3(X23))
| pred_attacker(X23) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax67])]) ).
cnf(c_0_28,plain,
( pred_attacker(tuple_A_out_3(X1))
| ~ pred_attacker(tuple_A_in_2(constr_comm_enc(X1,name_Ka))) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_29,plain,
! [X25] :
( ~ pred_attacker(tuple_A_out_1(X25))
| pred_attacker(X25) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax69])]) ).
cnf(c_0_30,plain,
( pred_attacker(constr_dec(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,plain,
constr_dec(constr_enc(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_A_out_4(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,plain,
pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_34,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[c_0_26]) ).
cnf(c_0_35,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_A_out_3(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,plain,
( pred_attacker(tuple_A_out_3(X1))
| ~ pred_attacker(constr_comm_enc(X1,name_Ka)) ),
inference(spm,[status(thm)],[c_0_28,c_0_17]) ).
cnf(c_0_37,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_A_out_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_38,plain,
pred_attacker(tuple_A_out_1(constr_comm_enc(name_m_9,name_Ka))),
inference(split_conjunct,[status(thm)],[ax77]) ).
cnf(c_0_39,plain,
( pred_attacker(X1)
| ~ pred_attacker(constr_enc(X1,X2))
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_40,plain,
pred_attacker(constr_enc(name_objective,name_m_9)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_41,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_42,plain,
( pred_attacker(X1)
| ~ pred_attacker(constr_comm_enc(X1,name_Ka)) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,plain,
pred_attacker(constr_comm_enc(name_m_9,name_Ka)),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
~ pred_attacker(name_m_9),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_45,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW955+1 : TPTP v8.1.0. Released v7.4.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n022.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 : Sun Jun 5 16:57:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.25/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.42 # Preprocessing time : 0.015 s
% 0.25/1.42
% 0.25/1.42 # Failure: Out of unprocessed clauses!
% 0.25/1.42 # OLD status GaveUp
% 0.25/1.42 # Parsed axioms : 82
% 0.25/1.42 # Removed by relevancy pruning/SinE : 30
% 0.25/1.42 # Initial clauses : 52
% 0.25/1.42 # Removed in clause preprocessing : 0
% 0.25/1.42 # Initial clauses in saturation : 52
% 0.25/1.42 # Processed clauses : 52
% 0.25/1.42 # ...of these trivial : 0
% 0.25/1.42 # ...subsumed : 0
% 0.25/1.42 # ...remaining for further processing : 52
% 0.25/1.42 # Other redundant clauses eliminated : 0
% 0.25/1.42 # Clauses deleted for lack of memory : 0
% 0.25/1.42 # Backward-subsumed : 0
% 0.25/1.42 # Backward-rewritten : 0
% 0.25/1.42 # Generated clauses : 0
% 0.25/1.42 # ...of the previous two non-trivial : 0
% 0.25/1.42 # Contextual simplify-reflections : 0
% 0.25/1.42 # Paramodulations : 0
% 0.25/1.42 # Factorizations : 0
% 0.25/1.42 # Equation resolutions : 0
% 0.25/1.42 # Current number of processed clauses : 52
% 0.25/1.42 # Positive orientable unit clauses : 6
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 46
% 0.25/1.42 # Non-unit-clauses : 0
% 0.25/1.42 # Current number of unprocessed clauses: 0
% 0.25/1.42 # ...number of literals in the above : 0
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 0
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 0
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 0
% 0.25/1.42 # Non-unit clause-clause subsumptions : 0
% 0.25/1.42 # Unit Clause-clause subsumption calls : 1
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 0
% 0.25/1.42 # BW rewrite match successes : 0
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 768
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.012 s
% 0.25/1.42 # System time : 0.003 s
% 0.25/1.42 # Total time : 0.015 s
% 0.25/1.42 # Maximum resident set size: 2768 pages
% 0.25/1.42 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.25/1.42 # Preprocessing time : 0.015 s
% 0.25/1.42
% 0.25/1.42 # Proof found!
% 0.25/1.42 # SZS status Theorem
% 0.25/1.42 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 46
% 0.25/1.43 # Proof object clause steps : 22
% 0.25/1.43 # Proof object formula steps : 24
% 0.25/1.43 # Proof object conjectures : 4
% 0.25/1.43 # Proof object clause conjectures : 1
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 12
% 0.25/1.43 # Proof object initial formulas used : 12
% 0.25/1.43 # Proof object generating inferences : 10
% 0.25/1.43 # Proof object simplifying inferences : 2
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 82
% 0.25/1.43 # Removed by relevancy pruning/SinE : 0
% 0.25/1.43 # Initial clauses : 82
% 0.25/1.43 # Removed in clause preprocessing : 0
% 0.25/1.43 # Initial clauses in saturation : 82
% 0.25/1.43 # Processed clauses : 93
% 0.25/1.43 # ...of these trivial : 0
% 0.25/1.43 # ...subsumed : 0
% 0.25/1.43 # ...remaining for further processing : 92
% 0.25/1.43 # Other redundant clauses eliminated : 0
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 1
% 0.25/1.43 # Backward-rewritten : 1
% 0.25/1.43 # Generated clauses : 47
% 0.25/1.43 # ...of the previous two non-trivial : 37
% 0.25/1.43 # Contextual simplify-reflections : 0
% 0.25/1.43 # Paramodulations : 47
% 0.25/1.43 # Factorizations : 0
% 0.25/1.43 # Equation resolutions : 0
% 0.25/1.43 # Current number of processed clauses : 90
% 0.25/1.43 # Positive orientable unit clauses : 16
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 47
% 0.25/1.43 # Non-unit-clauses : 27
% 0.25/1.43 # Current number of unprocessed clauses: 3
% 0.25/1.43 # ...number of literals in the above : 7
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 2
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 263
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 242
% 0.25/1.43 # Non-unit clause-clause subsumptions : 1
% 0.25/1.43 # Unit Clause-clause subsumption calls : 122
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 1
% 0.25/1.43 # BW rewrite match successes : 1
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 2564
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.017 s
% 0.25/1.43 # System time : 0.001 s
% 0.25/1.43 # Total time : 0.018 s
% 0.25/1.43 # Maximum resident set size: 2968 pages
%------------------------------------------------------------------------------