TSTP Solution File: SWV236+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV236+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:56:26 EDT 2023
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 32 ( 20 unt; 0 def)
% Number of atoms : 52 ( 14 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 18 ~; 14 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 45 ( 1 sgn; 23 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(xor_rules_1,axiom,
! [X1] : xor(X1,id) = X1,
file('/export/starexec/sandbox/tmp/tmp.a2C3cEGETB/E---3.1_1203.p',xor_rules_1) ).
fof(xor_commutative,axiom,
! [X1,X2] : xor(X1,X2) = xor(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.a2C3cEGETB/E---3.1_1203.p',xor_commutative) ).
fof(xor_associative,axiom,
! [X1,X2,X3] : xor(X1,xor(X2,X3)) = xor(xor(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.a2C3cEGETB/E---3.1_1203.p',xor_associative) ).
fof(xor_rules_2,axiom,
! [X1] : xor(X1,X1) = id,
file('/export/starexec/sandbox/tmp/tmp.a2C3cEGETB/E---3.1_1203.p',xor_rules_2) ).
fof(key_part_import___part_1,axiom,
! [X10,X9] :
( ( p(X10)
& p(X9) )
=> p(crypt(xor(km,xor(kp,X9)),X10)) ),
file('/export/starexec/sandbox/tmp/tmp.a2C3cEGETB/E---3.1_1203.p',key_part_import___part_1) ).
fof(find_known_exporter,conjecture,
? [X12] :
( p(crypt(xor(km,exp),X12))
& p(X12) ),
file('/export/starexec/sandbox/tmp/tmp.a2C3cEGETB/E---3.1_1203.p',find_known_exporter) ).
fof(combine_with_XOR,axiom,
! [X1,X2] :
( ( p(X1)
& p(X2) )
=> p(xor(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.a2C3cEGETB/E---3.1_1203.p',combine_with_XOR) ).
fof(initial_knowledge_of_intruder_1,axiom,
p(kp),
file('/export/starexec/sandbox/tmp/tmp.a2C3cEGETB/E---3.1_1203.p',initial_knowledge_of_intruder_1) ).
fof(initial_knowledge_of_intruder_9,axiom,
p(exp),
file('/export/starexec/sandbox/tmp/tmp.a2C3cEGETB/E---3.1_1203.p',initial_knowledge_of_intruder_9) ).
fof(c_0_9,plain,
! [X20] : xor(X20,id) = X20,
inference(variable_rename,[status(thm)],[xor_rules_1]) ).
fof(c_0_10,plain,
! [X13,X14] : xor(X13,X14) = xor(X14,X13),
inference(variable_rename,[status(thm)],[xor_commutative]) ).
fof(c_0_11,plain,
! [X15,X16,X17] : xor(X15,xor(X16,X17)) = xor(xor(X15,X16),X17),
inference(variable_rename,[status(thm)],[xor_associative]) ).
fof(c_0_12,plain,
! [X21] : xor(X21,X21) = id,
inference(variable_rename,[status(thm)],[xor_rules_2]) ).
cnf(c_0_13,plain,
xor(X1,id) = X1,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
xor(X1,X2) = xor(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X30,X31] :
( ~ p(X30)
| ~ p(X31)
| p(crypt(xor(km,xor(kp,X31)),X30)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[key_part_import___part_1])]) ).
cnf(c_0_16,plain,
xor(X1,xor(X2,X3)) = xor(xor(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
xor(X1,X1) = id,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
xor(id,X1) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_19,negated_conjecture,
~ ? [X12] :
( p(crypt(xor(km,exp),X12))
& p(X12) ),
inference(assume_negation,[status(cth)],[find_known_exporter]) ).
cnf(c_0_20,plain,
( p(crypt(xor(km,xor(kp,X2)),X1))
| ~ p(X1)
| ~ p(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
xor(X1,xor(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
fof(c_0_22,plain,
! [X48,X49] :
( ~ p(X48)
| ~ p(X49)
| p(xor(X48,X49)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[combine_with_XOR])]) ).
fof(c_0_23,negated_conjecture,
! [X56] :
( ~ p(crypt(xor(km,exp),X56))
| ~ p(X56) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])]) ).
cnf(c_0_24,plain,
( p(crypt(xor(km,X1),X2))
| ~ p(xor(kp,X1))
| ~ p(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( p(xor(X1,X2))
| ~ p(X1)
| ~ p(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
p(kp),
inference(split_conjunct,[status(thm)],[initial_knowledge_of_intruder_1]) ).
cnf(c_0_27,negated_conjecture,
( ~ p(crypt(xor(km,exp),X1))
| ~ p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
( p(crypt(xor(km,X1),X2))
| ~ p(X2)
| ~ p(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_29,plain,
p(exp),
inference(split_conjunct,[status(thm)],[initial_knowledge_of_intruder_9]) ).
cnf(c_0_30,negated_conjecture,
~ p(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_31,plain,
$false,
inference(sr,[status(thm)],[c_0_29,c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SWV236+1 : TPTP v8.1.2. Released v3.2.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 2400
% 0.11/0.30 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Oct 3 03:26:50 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.a2C3cEGETB/E---3.1_1203.p
% 0.15/0.43 # Version: 3.1pre001
% 0.15/0.43 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1280 completed with status 0
% 0.15/0.43 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.15/0.43 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: FHHSM-FFMM22-MFFFFFNN
% 0.15/0.43 # partial match(1): FHUSM-FFMM22-MFFFFFNN
% 0.15/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.43 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 136s (1) cores
% 0.15/0.43 # Starting sh5l with 136s (1) cores
% 0.15/0.43 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1287 completed with status 0
% 0.15/0.43 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.15/0.43 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: FHHSM-FFMM22-MFFFFFNN
% 0.15/0.43 # partial match(1): FHUSM-FFMM22-MFFFFFNN
% 0.15/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.43 # Preprocessing time : 0.001 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Theorem
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 28
% 0.15/0.43 # Removed by relevancy pruning/SinE : 0
% 0.15/0.43 # Initial clauses : 28
% 0.15/0.43 # Removed in clause preprocessing : 0
% 0.15/0.43 # Initial clauses in saturation : 28
% 0.15/0.43 # Processed clauses : 228
% 0.15/0.43 # ...of these trivial : 4
% 0.15/0.43 # ...subsumed : 120
% 0.15/0.43 # ...remaining for further processing : 104
% 0.15/0.43 # Other redundant clauses eliminated : 0
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 53
% 0.15/0.43 # Backward-rewritten : 0
% 0.15/0.43 # Generated clauses : 553
% 0.15/0.43 # ...of the previous two non-redundant : 457
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 0
% 0.15/0.43 # Paramodulations : 541
% 0.15/0.43 # Factorizations : 0
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 0
% 0.15/0.43 # Total rewrite steps : 280
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 11
% 0.15/0.43 # Positive orientable unit clauses : 7
% 0.15/0.43 # Positive unorientable unit clauses: 3
% 0.15/0.43 # Negative unit clauses : 1
% 0.15/0.43 # Non-unit-clauses : 0
% 0.15/0.43 # Current number of unprocessed clauses: 267
% 0.15/0.43 # ...number of literals in the above : 728
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 93
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 902
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 794
% 0.15/0.43 # Non-unit clause-clause subsumptions : 92
% 0.15/0.43 # Unit Clause-clause subsumption calls : 98
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 40
% 0.15/0.43 # BW rewrite match successes : 33
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 7952
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.010 s
% 0.15/0.43 # System time : 0.003 s
% 0.15/0.43 # Total time : 0.013 s
% 0.15/0.43 # Maximum resident set size: 1816 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.042 s
% 0.15/0.43 # System time : 0.008 s
% 0.15/0.43 # Total time : 0.051 s
% 0.15/0.43 # Maximum resident set size: 1708 pages
% 0.15/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------