TSTP Solution File: SWW948+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWW948+1 : TPTP v8.1.2. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:12:01 EDT 2023
% Result : Theorem 0.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of formulae : 59 ( 31 unt; 0 def)
% Number of atoms : 95 ( 14 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 66 ( 30 ~; 26 |; 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 : 63 ( 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/sandbox2/tmp/tmp.9mjvKSKDrh/E---3.1_617.p',ax106) ).
fof(ax68,axiom,
! [X3,X4] : constr_xor(X3,X4) = constr_xor(X4,X3),
file('/export/starexec/sandbox2/tmp/tmp.9mjvKSKDrh/E---3.1_617.p',ax68) ).
fof(ax67,axiom,
! [X2] : constr_xor(X2,constr_ZERO) = X2,
file('/export/starexec/sandbox2/tmp/tmp.9mjvKSKDrh/E---3.1_617.p',ax67) ).
fof(ax88,axiom,
! [X27,X28] :
( ( pred_attacker(X27)
& pred_attacker(X28) )
=> pred_attacker(tuple_R_in_2(X27,X28)) ),
file('/export/starexec/sandbox2/tmp/tmp.9mjvKSKDrh/E---3.1_617.p',ax88) ).
fof(ax69,axiom,
! [X5,X6,X7] : constr_xor(X5,constr_xor(X6,X7)) = constr_xor(constr_xor(X5,X6),X7),
file('/export/starexec/sandbox2/tmp/tmp.9mjvKSKDrh/E---3.1_617.p',ax69) ).
fof(ax66,axiom,
! [X1] : constr_xor(X1,X1) = constr_ZERO,
file('/export/starexec/sandbox2/tmp/tmp.9mjvKSKDrh/E---3.1_617.p',ax66) ).
fof(ax76,axiom,
! [X16,X17] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X16,X17))
=> pred_attacker(X17) ),
file('/export/starexec/sandbox2/tmp/tmp.9mjvKSKDrh/E---3.1_617.p',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/sandbox2/tmp/tmp.9mjvKSKDrh/E---3.1_617.p',ax102) ).
fof(ax83,axiom,
! [X22] :
( pred_attacker(tuple_R_out_4(X22))
=> pred_attacker(X22) ),
file('/export/starexec/sandbox2/tmp/tmp.9mjvKSKDrh/E---3.1_617.p',ax83) ).
fof(co0,conjecture,
pred_attacker(name_objective_R),
file('/export/starexec/sandbox2/tmp/tmp.9mjvKSKDrh/E---3.1_617.p',co0) ).
fof(ax87,axiom,
! [X26] :
( pred_attacker(tuple_R_out_1(X26))
=> pred_attacker(X26) ),
file('/export/starexec/sandbox2/tmp/tmp.9mjvKSKDrh/E---3.1_617.p',ax87) ).
fof(ax70,axiom,
! [X8,X9] :
( ( pred_attacker(X8)
& pred_attacker(X9) )
=> pred_attacker(constr_xor(X8,X9)) ),
file('/export/starexec/sandbox2/tmp/tmp.9mjvKSKDrh/E---3.1_617.p',ax70) ).
fof(ax104,axiom,
pred_attacker(tuple_R_out_1(name_r0x30)),
file('/export/starexec/sandbox2/tmp/tmp.9mjvKSKDrh/E---3.1_617.p',ax104) ).
fof(ax75,axiom,
! [X14,X15] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X14,X15))
=> pred_attacker(X14) ),
file('/export/starexec/sandbox2/tmp/tmp.9mjvKSKDrh/E---3.1_617.p',ax75) ).
fof(ax78,axiom,
! [X19] :
( pred_attacker(tuple_knowledge_from_1st_round_out_1(X19))
=> pred_attacker(X19) ),
file('/export/starexec/sandbox2/tmp/tmp.9mjvKSKDrh/E---3.1_617.p',ax78) ).
fof(ax101,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r0x30_from_1st)),
file('/export/starexec/sandbox2/tmp/tmp.9mjvKSKDrh/E---3.1_617.p',ax101) ).
fof(c_0_16,plain,
! [X43] :
( ~ pred_attacker(tuple_R_in_2(X43,constr_h(constr_xor(constr_xor(name_r0x30,X43),name_k))))
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax106])]) ).
fof(c_0_17,plain,
! [X46,X47] : constr_xor(X46,X47) = constr_xor(X47,X46),
inference(variable_rename,[status(thm)],[ax68]) ).
fof(c_0_18,plain,
! [X45] : constr_xor(X45,constr_ZERO) = X45,
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,
! [X54,X55] :
( ~ pred_attacker(X54)
| ~ pred_attacker(X55)
| pred_attacker(tuple_R_in_2(X54,X55)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax88])]) ).
fof(c_0_22,plain,
! [X48,X49,X50] : constr_xor(X48,constr_xor(X49,X50)) = constr_xor(constr_xor(X48,X49),X50),
inference(variable_rename,[status(thm)],[ax69]) ).
fof(c_0_23,plain,
! [X44] : constr_xor(X44,X44) = 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]) ).
fof(c_0_25,plain,
! [X65,X66] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X65,X66))
| pred_attacker(X66) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax76])]) ).
cnf(c_0_26,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_27,plain,
( pred_attacker(tuple_R_in_2(X1,X2))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,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_29,plain,
constr_xor(X1,X1) = constr_ZERO,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
constr_xor(constr_ZERO,X1) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_31,plain,
( pred_attacker(X2)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,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]) ).
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_26,c_0_27]) ).
cnf(c_0_34,plain,
constr_xor(X1,constr_xor(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_35,plain,
pred_attacker(constr_h(constr_xor(constr_xor(name_r0x30_from_1st,name_r1_from_1st),name_k))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
fof(c_0_36,plain,
! [X53] :
( ~ pred_attacker(tuple_R_out_4(X53))
| pred_attacker(X53) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])]) ).
cnf(c_0_37,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_38,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_20]) ).
fof(c_0_39,negated_conjecture,
~ pred_attacker(name_objective_R),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co0])]) ).
fof(c_0_40,plain,
! [X72] :
( ~ pred_attacker(tuple_R_out_1(X72))
| pred_attacker(X72) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax87])]) ).
cnf(c_0_41,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_R_out_4(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,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_37,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
~ pred_attacker(name_objective_R),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
fof(c_0_44,plain,
! [X41,X42] :
( ~ pred_attacker(X41)
| ~ pred_attacker(X42)
| pred_attacker(constr_xor(X41,X42)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax70])]) ).
cnf(c_0_45,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_R_out_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_46,plain,
pred_attacker(tuple_R_out_1(name_r0x30)),
inference(split_conjunct,[status(thm)],[ax104]) ).
fof(c_0_47,plain,
! [X63,X64] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X63,X64))
| pred_attacker(X63) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax75])]) ).
fof(c_0_48,plain,
! [X74] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X74))
| pred_attacker(X74) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
cnf(c_0_49,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_41,c_0_42]),c_0_43]) ).
cnf(c_0_50,plain,
( pred_attacker(constr_xor(X1,X2))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_51,plain,
pred_attacker(name_r0x30),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,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_53,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_54,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r0x30_from_1st)),
inference(split_conjunct,[status(thm)],[ax101]) ).
cnf(c_0_55,plain,
~ pred_attacker(constr_xor(name_r0x30_from_1st,name_r1_from_1st)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).
cnf(c_0_56,plain,
pred_attacker(name_r1_from_1st),
inference(spm,[status(thm)],[c_0_52,c_0_32]) ).
cnf(c_0_57,plain,
pred_attacker(name_r0x30_from_1st),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_50]),c_0_56]),c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SWW948+1 : TPTP v8.1.2. Released v7.4.0.
% 0.08/0.09 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n001.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 2400
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon Oct 2 23:10:52 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.9mjvKSKDrh/E---3.1_617.p
% 0.14/0.42 # Version: 3.1pre001
% 0.14/0.42 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 # Starting sh5l with 300s (1) cores
% 0.14/0.42 # sh5l with pid 721 completed with status 0
% 0.14/0.42 # Result found by sh5l
% 0.14/0.42 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 # Starting sh5l with 300s (1) cores
% 0.14/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.42 # Search class: FHUSM-FFMM21-DFFFFFNN
% 0.14/0.42 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.42 # Starting new_ho_10 with 55s (1) cores
% 0.14/0.42 # new_ho_10 with pid 727 completed with status 0
% 0.14/0.42 # Result found by new_ho_10
% 0.14/0.42 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 # Starting sh5l with 300s (1) cores
% 0.14/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.42 # Search class: FHUSM-FFMM21-DFFFFFNN
% 0.14/0.42 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.42 # Starting new_ho_10 with 55s (1) cores
% 0.14/0.42 # Preprocessing time : 0.001 s
% 0.14/0.42 # Presaturation interreduction done
% 0.14/0.42
% 0.14/0.42 # Proof found!
% 0.14/0.42 # SZS status Theorem
% 0.14/0.42 # SZS output start CNFRefutation
% See solution above
% 0.14/0.42 # Parsed axioms : 108
% 0.14/0.42 # Removed by relevancy pruning/SinE : 6
% 0.14/0.42 # Initial clauses : 102
% 0.14/0.42 # Removed in clause preprocessing : 0
% 0.14/0.42 # Initial clauses in saturation : 102
% 0.14/0.42 # Processed clauses : 323
% 0.14/0.42 # ...of these trivial : 25
% 0.14/0.42 # ...subsumed : 50
% 0.14/0.42 # ...remaining for further processing : 248
% 0.14/0.42 # Other redundant clauses eliminated : 0
% 0.14/0.42 # Clauses deleted for lack of memory : 0
% 0.14/0.42 # Backward-subsumed : 3
% 0.14/0.42 # Backward-rewritten : 1
% 0.14/0.42 # Generated clauses : 436
% 0.14/0.42 # ...of the previous two non-redundant : 347
% 0.14/0.42 # ...aggressively subsumed : 0
% 0.14/0.42 # Contextual simplify-reflections : 0
% 0.14/0.42 # Paramodulations : 436
% 0.14/0.42 # Factorizations : 0
% 0.14/0.42 # NegExts : 0
% 0.14/0.42 # Equation resolutions : 0
% 0.14/0.42 # Total rewrite steps : 363
% 0.14/0.42 # Propositional unsat checks : 0
% 0.14/0.42 # Propositional check models : 0
% 0.14/0.42 # Propositional check unsatisfiable : 0
% 0.14/0.42 # Propositional clauses : 0
% 0.14/0.42 # Propositional clauses after purity: 0
% 0.14/0.42 # Propositional unsat core size : 0
% 0.14/0.42 # Propositional preprocessing time : 0.000
% 0.14/0.42 # Propositional encoding time : 0.000
% 0.14/0.42 # Propositional solver time : 0.000
% 0.14/0.42 # Success case prop preproc time : 0.000
% 0.14/0.42 # Success case prop encoding time : 0.000
% 0.14/0.42 # Success case prop solver time : 0.000
% 0.14/0.42 # Current number of processed clauses : 142
% 0.14/0.42 # Positive orientable unit clauses : 29
% 0.14/0.42 # Positive unorientable unit clauses: 3
% 0.14/0.42 # Negative unit clauses : 73
% 0.14/0.42 # Non-unit-clauses : 37
% 0.14/0.42 # Current number of unprocessed clauses: 223
% 0.14/0.42 # ...number of literals in the above : 458
% 0.14/0.42 # Current number of archived formulas : 0
% 0.14/0.42 # Current number of archived clauses : 106
% 0.14/0.42 # Clause-clause subsumption calls (NU) : 1407
% 0.14/0.42 # Rec. Clause-clause subsumption calls : 1363
% 0.14/0.42 # Non-unit clause-clause subsumptions : 24
% 0.14/0.42 # Unit Clause-clause subsumption calls : 1474
% 0.14/0.42 # Rewrite failures with RHS unbound : 0
% 0.14/0.42 # BW rewrite match attempts : 65
% 0.14/0.42 # BW rewrite match successes : 35
% 0.14/0.42 # Condensation attempts : 323
% 0.14/0.42 # Condensation successes : 1
% 0.14/0.42 # Termbank termtop insertions : 7198
% 0.14/0.42
% 0.14/0.42 # -------------------------------------------------
% 0.14/0.42 # User time : 0.011 s
% 0.14/0.42 # System time : 0.004 s
% 0.14/0.42 # Total time : 0.016 s
% 0.14/0.42 # Maximum resident set size: 1888 pages
% 0.14/0.42
% 0.14/0.42 # -------------------------------------------------
% 0.14/0.42 # User time : 0.014 s
% 0.14/0.42 # System time : 0.005 s
% 0.14/0.42 # Total time : 0.019 s
% 0.14/0.42 # Maximum resident set size: 1768 pages
% 0.14/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------