TSTP Solution File: SWV011-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWV011-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n009.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 : 300s
% DateTime : Wed May 29 18:04:17 EDT 2024
% Result : Unsatisfiable 0.20s 0.51s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWV011-1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.14 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n009.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 27 00:07:54 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.51 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.M59sWyxwC7/cvc5---1.0.5_15150.smt2
% 0.20/0.51 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.M59sWyxwC7/cvc5---1.0.5_15150.smt2
% 0.20/0.51 (assume a0 (tptp.b_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.a)))
% 0.20/0.51 (assume a1 (tptp.a_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.b)))
% 0.20/0.51 (assume a2 (forall ((A $$unsorted)) (or (not (tptp.a_holds (tptp.key A tptp.b))) (not (tptp.b_holds (tptp.key A tptp.a))))))
% 0.20/0.51 (step t1 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.a_holds (tptp.key A tptp.b))) (not (tptp.b_holds (tptp.key A tptp.a))))) (or (not (tptp.a_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.b))) (not (tptp.b_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.a))))) (forall ((A $$unsorted)) (or (not (tptp.a_holds (tptp.key A tptp.b))) (not (tptp.b_holds (tptp.key A tptp.a)))))) :rule implies_neg1)
% 0.20/0.51 (anchor :step t2)
% 0.20/0.51 (assume t2.a0 (forall ((A $$unsorted)) (or (not (tptp.a_holds (tptp.key A tptp.b))) (not (tptp.b_holds (tptp.key A tptp.a))))))
% 0.20/0.51 (step t2.t1 (cl (or (not (forall ((A $$unsorted)) (or (not (tptp.a_holds (tptp.key A tptp.b))) (not (tptp.b_holds (tptp.key A tptp.a)))))) (or (not (tptp.a_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.b))) (not (tptp.b_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.a)))))) :rule forall_inst :args ((:= A (tptp.generate_key tptp.an_a_nonce))))
% 0.20/0.51 (step t2.t2 (cl (not (forall ((A $$unsorted)) (or (not (tptp.a_holds (tptp.key A tptp.b))) (not (tptp.b_holds (tptp.key A tptp.a)))))) (or (not (tptp.a_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.b))) (not (tptp.b_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.a))))) :rule or :premises (t2.t1))
% 0.20/0.51 (step t2.t3 (cl (or (not (tptp.a_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.b))) (not (tptp.b_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.a))))) :rule resolution :premises (t2.t2 t2.a0))
% 0.20/0.51 (step t2 (cl (not (forall ((A $$unsorted)) (or (not (tptp.a_holds (tptp.key A tptp.b))) (not (tptp.b_holds (tptp.key A tptp.a)))))) (or (not (tptp.a_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.b))) (not (tptp.b_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.a))))) :rule subproof :discharge (t2.a0))
% 0.20/0.51 (step t3 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.a_holds (tptp.key A tptp.b))) (not (tptp.b_holds (tptp.key A tptp.a))))) (or (not (tptp.a_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.b))) (not (tptp.b_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.a))))) (or (not (tptp.a_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.b))) (not (tptp.b_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.a))))) :rule resolution :premises (t1 t2))
% 0.20/0.51 (step t4 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.a_holds (tptp.key A tptp.b))) (not (tptp.b_holds (tptp.key A tptp.a))))) (or (not (tptp.a_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.b))) (not (tptp.b_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.a))))) (not (or (not (tptp.a_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.b))) (not (tptp.b_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.a)))))) :rule implies_neg2)
% 0.20/0.51 (step t5 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.a_holds (tptp.key A tptp.b))) (not (tptp.b_holds (tptp.key A tptp.a))))) (or (not (tptp.a_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.b))) (not (tptp.b_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.a))))) (=> (forall ((A $$unsorted)) (or (not (tptp.a_holds (tptp.key A tptp.b))) (not (tptp.b_holds (tptp.key A tptp.a))))) (or (not (tptp.a_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.b))) (not (tptp.b_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.a)))))) :rule resolution :premises (t3 t4))
% 0.20/0.51 (step t6 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.a_holds (tptp.key A tptp.b))) (not (tptp.b_holds (tptp.key A tptp.a))))) (or (not (tptp.a_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.b))) (not (tptp.b_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.a)))))) :rule contraction :premises (t5))
% 0.20/0.51 (step t7 (cl (not (forall ((A $$unsorted)) (or (not (tptp.a_holds (tptp.key A tptp.b))) (not (tptp.b_holds (tptp.key A tptp.a)))))) (or (not (tptp.a_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.b))) (not (tptp.b_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.a))))) :rule implies :premises (t6))
% 0.20/0.51 (step t8 (cl (not (or (not (tptp.a_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.b))) (not (tptp.b_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.a))))) (not (tptp.a_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.b))) (not (tptp.b_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.a)))) :rule or_pos)
% 0.20/0.51 (step t9 (cl (not (tptp.b_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.a))) (not (tptp.a_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.b))) (not (or (not (tptp.a_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.b))) (not (tptp.b_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.a)))))) :rule reordering :premises (t8))
% 0.20/0.51 (step t10 (cl (not (or (not (tptp.a_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.b))) (not (tptp.b_holds (tptp.key (tptp.generate_key tptp.an_a_nonce) tptp.a)))))) :rule resolution :premises (t9 a0 a1))
% 0.20/0.51 (step t11 (cl) :rule resolution :premises (t7 t10 a2))
% 0.20/0.51
% 0.20/0.51 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.M59sWyxwC7/cvc5---1.0.5_15150.smt2
% 0.20/0.52 % cvc5---1.0.5 exiting
% 0.20/0.52 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------