TSTP Solution File: MGT041-2 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : MGT041-2 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n028.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 17:29:28 EDT 2024
% Result : Unsatisfiable 0.20s 0.52s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : MGT041-2 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n028.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 26 10:22:54 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.50 %----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.52 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.Hsmt8XXKwk/cvc5---1.0.5_23637.smt2
% 0.20/0.52 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.Hsmt8XXKwk/cvc5---1.0.5_23637.smt2
% 0.20/0.52 (assume a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.number_of_routines A B tptp.low)) (not (tptp.number_of_routines A B tptp.high)))))
% 0.20/0.52 (assume a1 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.efficient_producer A)) (not (tptp.founding_time A B)) (tptp.has_elaborated_routines A B))))
% 0.20/0.52 (assume a2 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.first_mover A)) (not (tptp.founding_time A B)) (tptp.number_of_routines A B tptp.low))))
% 0.20/0.52 (assume a3 (tptp.organisation_at_time tptp.sk1 tptp.sk2))
% 0.20/0.52 (assume a4 (tptp.founding_time tptp.sk1 tptp.sk2))
% 0.20/0.52 (assume a5 (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.high))
% 0.20/0.52 (assume a6 (not (tptp.has_elaborated_routines tptp.sk1 tptp.sk2)))
% 0.20/0.52 (assume a7 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (tptp.first_mover A) (tptp.efficient_producer A))))
% 0.20/0.52 (step t1 (cl (not (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (tptp.first_mover tptp.sk1) (tptp.efficient_producer tptp.sk1))) (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (tptp.first_mover tptp.sk1) (tptp.efficient_producer tptp.sk1)) :rule or_pos)
% 0.20/0.52 (step t2 (cl (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (tptp.efficient_producer tptp.sk1) (tptp.first_mover tptp.sk1) (not (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (tptp.first_mover tptp.sk1) (tptp.efficient_producer tptp.sk1)))) :rule reordering :premises (t1))
% 0.20/0.52 (step t3 (cl (not (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.first_mover tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low))) (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.first_mover tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)) :rule or_pos)
% 0.20/0.52 (step t4 (cl (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low) (not (tptp.first_mover tptp.sk1)) (not (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.first_mover tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)))) :rule reordering :premises (t3))
% 0.20/0.52 (step t5 (cl (not (or (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)) (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.high)))) (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)) (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.high))) :rule or_pos)
% 0.20/0.52 (step t6 (cl (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.high)) (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)) (not (or (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)) (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.high))))) :rule reordering :premises (t5))
% 0.20/0.52 (step t7 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.number_of_routines A B tptp.low)) (not (tptp.number_of_routines A B tptp.high)))) (or (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)) (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.high)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.number_of_routines A B tptp.low)) (not (tptp.number_of_routines A B tptp.high))))) :rule implies_neg1)
% 0.20/0.52 (anchor :step t8)
% 0.20/0.52 (assume t8.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.number_of_routines A B tptp.low)) (not (tptp.number_of_routines A B tptp.high)))))
% 0.20/0.52 (step t8.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.number_of_routines A B tptp.low)) (not (tptp.number_of_routines A B tptp.high))))) (or (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)) (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.high))))) :rule forall_inst :args ((:= A tptp.sk1) (:= B tptp.sk2)))
% 0.20/0.52 (step t8.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.number_of_routines A B tptp.low)) (not (tptp.number_of_routines A B tptp.high))))) (or (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)) (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.high)))) :rule or :premises (t8.t1))
% 0.20/0.52 (step t8.t3 (cl (or (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)) (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.high)))) :rule resolution :premises (t8.t2 t8.a0))
% 0.20/0.52 (step t8 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.number_of_routines A B tptp.low)) (not (tptp.number_of_routines A B tptp.high))))) (or (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)) (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.high)))) :rule subproof :discharge (t8.a0))
% 0.20/0.52 (step t9 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.number_of_routines A B tptp.low)) (not (tptp.number_of_routines A B tptp.high)))) (or (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)) (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.high)))) (or (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)) (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.high)))) :rule resolution :premises (t7 t8))
% 0.20/0.52 (step t10 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.number_of_routines A B tptp.low)) (not (tptp.number_of_routines A B tptp.high)))) (or (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)) (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.high)))) (not (or (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)) (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.high))))) :rule implies_neg2)
% 0.20/0.52 (step t11 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.number_of_routines A B tptp.low)) (not (tptp.number_of_routines A B tptp.high)))) (or (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)) (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.high)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.number_of_routines A B tptp.low)) (not (tptp.number_of_routines A B tptp.high)))) (or (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)) (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.high))))) :rule resolution :premises (t9 t10))
% 0.20/0.52 (step t12 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.number_of_routines A B tptp.low)) (not (tptp.number_of_routines A B tptp.high)))) (or (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)) (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.high))))) :rule contraction :premises (t11))
% 0.20/0.52 (step t13 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.number_of_routines A B tptp.low)) (not (tptp.number_of_routines A B tptp.high))))) (or (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)) (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.high)))) :rule implies :premises (t12))
% 0.20/0.52 (step t14 (cl (or (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)) (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.high)))) :rule resolution :premises (t13 a0))
% 0.20/0.52 (step t15 (cl (not (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low))) :rule resolution :premises (t6 a5 t14))
% 0.20/0.52 (step t16 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.first_mover A)) (not (tptp.founding_time A B)) (tptp.number_of_routines A B tptp.low))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.first_mover tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.first_mover A)) (not (tptp.founding_time A B)) (tptp.number_of_routines A B tptp.low)))) :rule implies_neg1)
% 0.20/0.52 (anchor :step t17)
% 0.20/0.52 (assume t17.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.first_mover A)) (not (tptp.founding_time A B)) (tptp.number_of_routines A B tptp.low))))
% 0.20/0.52 (step t17.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.first_mover A)) (not (tptp.founding_time A B)) (tptp.number_of_routines A B tptp.low)))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.first_mover tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)))) :rule forall_inst :args ((:= A tptp.sk1) (:= B tptp.sk2)))
% 0.20/0.52 (step t17.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.first_mover A)) (not (tptp.founding_time A B)) (tptp.number_of_routines A B tptp.low)))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.first_mover tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low))) :rule or :premises (t17.t1))
% 0.20/0.52 (step t17.t3 (cl (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.first_mover tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low))) :rule resolution :premises (t17.t2 t17.a0))
% 0.20/0.52 (step t17 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.first_mover A)) (not (tptp.founding_time A B)) (tptp.number_of_routines A B tptp.low)))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.first_mover tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low))) :rule subproof :discharge (t17.a0))
% 0.20/0.52 (step t18 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.first_mover A)) (not (tptp.founding_time A B)) (tptp.number_of_routines A B tptp.low))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.first_mover tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.first_mover tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low))) :rule resolution :premises (t16 t17))
% 0.20/0.52 (step t19 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.first_mover A)) (not (tptp.founding_time A B)) (tptp.number_of_routines A B tptp.low))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.first_mover tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low))) (not (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.first_mover tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)))) :rule implies_neg2)
% 0.20/0.52 (step t20 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.first_mover A)) (not (tptp.founding_time A B)) (tptp.number_of_routines A B tptp.low))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.first_mover tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.first_mover A)) (not (tptp.founding_time A B)) (tptp.number_of_routines A B tptp.low))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.first_mover tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)))) :rule resolution :premises (t18 t19))
% 0.20/0.52 (step t21 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.first_mover A)) (not (tptp.founding_time A B)) (tptp.number_of_routines A B tptp.low))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.first_mover tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low)))) :rule contraction :premises (t20))
% 0.20/0.52 (step t22 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.first_mover A)) (not (tptp.founding_time A B)) (tptp.number_of_routines A B tptp.low)))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.first_mover tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low))) :rule implies :premises (t21))
% 0.20/0.52 (step t23 (cl (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.first_mover tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.number_of_routines tptp.sk1 tptp.sk2 tptp.low))) :rule resolution :premises (t22 a2))
% 0.20/0.52 (step t24 (cl (not (tptp.first_mover tptp.sk1))) :rule resolution :premises (t4 a3 a4 t15 t23))
% 0.20/0.52 (step t25 (cl (not (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.efficient_producer tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.has_elaborated_routines tptp.sk1 tptp.sk2))) (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.efficient_producer tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.has_elaborated_routines tptp.sk1 tptp.sk2)) :rule or_pos)
% 0.20/0.52 (step t26 (cl (tptp.has_elaborated_routines tptp.sk1 tptp.sk2) (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (not (tptp.efficient_producer tptp.sk1)) (not (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.efficient_producer tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.has_elaborated_routines tptp.sk1 tptp.sk2)))) :rule reordering :premises (t25))
% 0.20/0.52 (step t27 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.efficient_producer A)) (not (tptp.founding_time A B)) (tptp.has_elaborated_routines A B))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.efficient_producer tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.has_elaborated_routines tptp.sk1 tptp.sk2))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.efficient_producer A)) (not (tptp.founding_time A B)) (tptp.has_elaborated_routines A B)))) :rule implies_neg1)
% 0.20/0.52 (anchor :step t28)
% 0.20/0.52 (assume t28.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.efficient_producer A)) (not (tptp.founding_time A B)) (tptp.has_elaborated_routines A B))))
% 0.20/0.52 (step t28.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.efficient_producer A)) (not (tptp.founding_time A B)) (tptp.has_elaborated_routines A B)))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.efficient_producer tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.has_elaborated_routines tptp.sk1 tptp.sk2)))) :rule forall_inst :args ((:= A tptp.sk1) (:= B tptp.sk2)))
% 0.20/0.52 (step t28.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.efficient_producer A)) (not (tptp.founding_time A B)) (tptp.has_elaborated_routines A B)))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.efficient_producer tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.has_elaborated_routines tptp.sk1 tptp.sk2))) :rule or :premises (t28.t1))
% 0.20/0.52 (step t28.t3 (cl (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.efficient_producer tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.has_elaborated_routines tptp.sk1 tptp.sk2))) :rule resolution :premises (t28.t2 t28.a0))
% 0.20/0.52 (step t28 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.efficient_producer A)) (not (tptp.founding_time A B)) (tptp.has_elaborated_routines A B)))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.efficient_producer tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.has_elaborated_routines tptp.sk1 tptp.sk2))) :rule subproof :discharge (t28.a0))
% 0.20/0.52 (step t29 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.efficient_producer A)) (not (tptp.founding_time A B)) (tptp.has_elaborated_routines A B))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.efficient_producer tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.has_elaborated_routines tptp.sk1 tptp.sk2))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.efficient_producer tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.has_elaborated_routines tptp.sk1 tptp.sk2))) :rule resolution :premises (t27 t28))
% 0.20/0.52 (step t30 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.efficient_producer A)) (not (tptp.founding_time A B)) (tptp.has_elaborated_routines A B))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.efficient_producer tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.has_elaborated_routines tptp.sk1 tptp.sk2))) (not (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.efficient_producer tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.has_elaborated_routines tptp.sk1 tptp.sk2)))) :rule implies_neg2)
% 0.20/0.52 (step t31 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.efficient_producer A)) (not (tptp.founding_time A B)) (tptp.has_elaborated_routines A B))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.efficient_producer tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.has_elaborated_routines tptp.sk1 tptp.sk2))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.efficient_producer A)) (not (tptp.founding_time A B)) (tptp.has_elaborated_routines A B))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.efficient_producer tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.has_elaborated_routines tptp.sk1 tptp.sk2)))) :rule resolution :premises (t29 t30))
% 0.20/0.52 (step t32 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.efficient_producer A)) (not (tptp.founding_time A B)) (tptp.has_elaborated_routines A B))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.efficient_producer tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.has_elaborated_routines tptp.sk1 tptp.sk2)))) :rule contraction :premises (t31))
% 0.20/0.52 (step t33 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (not (tptp.efficient_producer A)) (not (tptp.founding_time A B)) (tptp.has_elaborated_routines A B)))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.efficient_producer tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.has_elaborated_routines tptp.sk1 tptp.sk2))) :rule implies :premises (t32))
% 0.20/0.52 (step t34 (cl (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (not (tptp.efficient_producer tptp.sk1)) (not (tptp.founding_time tptp.sk1 tptp.sk2)) (tptp.has_elaborated_routines tptp.sk1 tptp.sk2))) :rule resolution :premises (t33 a1))
% 0.20/0.52 (step t35 (cl (not (tptp.efficient_producer tptp.sk1))) :rule resolution :premises (t26 a6 a3 a4 t34))
% 0.20/0.52 (step t36 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (tptp.first_mover A) (tptp.efficient_producer A))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (tptp.first_mover tptp.sk1) (tptp.efficient_producer tptp.sk1))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (tptp.first_mover A) (tptp.efficient_producer A)))) :rule implies_neg1)
% 0.20/0.52 (anchor :step t37)
% 0.20/0.52 (assume t37.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (tptp.first_mover A) (tptp.efficient_producer A))))
% 0.20/0.52 (step t37.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (tptp.first_mover A) (tptp.efficient_producer A)))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (tptp.first_mover tptp.sk1) (tptp.efficient_producer tptp.sk1)))) :rule forall_inst :args ((:= A tptp.sk1) (:= B tptp.sk2)))
% 0.20/0.52 (step t37.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (tptp.first_mover A) (tptp.efficient_producer A)))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (tptp.first_mover tptp.sk1) (tptp.efficient_producer tptp.sk1))) :rule or :premises (t37.t1))
% 0.20/0.52 (step t37.t3 (cl (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (tptp.first_mover tptp.sk1) (tptp.efficient_producer tptp.sk1))) :rule resolution :premises (t37.t2 t37.a0))
% 0.20/0.52 (step t37 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (tptp.first_mover A) (tptp.efficient_producer A)))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (tptp.first_mover tptp.sk1) (tptp.efficient_producer tptp.sk1))) :rule subproof :discharge (t37.a0))
% 0.20/0.52 (step t38 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (tptp.first_mover A) (tptp.efficient_producer A))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (tptp.first_mover tptp.sk1) (tptp.efficient_producer tptp.sk1))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (tptp.first_mover tptp.sk1) (tptp.efficient_producer tptp.sk1))) :rule resolution :premises (t36 t37))
% 0.20/0.52 (step t39 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (tptp.first_mover A) (tptp.efficient_producer A))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (tptp.first_mover tptp.sk1) (tptp.efficient_producer tptp.sk1))) (not (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (tptp.first_mover tptp.sk1) (tptp.efficient_producer tptp.sk1)))) :rule implies_neg2)
% 0.20/0.52 (step t40 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (tptp.first_mover A) (tptp.efficient_producer A))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (tptp.first_mover tptp.sk1) (tptp.efficient_producer tptp.sk1))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (tptp.first_mover A) (tptp.efficient_producer A))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (tptp.first_mover tptp.sk1) (tptp.efficient_producer tptp.sk1)))) :rule resolution :premises (t38 t39))
% 0.20/0.52 (step t41 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (tptp.first_mover A) (tptp.efficient_producer A))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (tptp.first_mover tptp.sk1) (tptp.efficient_producer tptp.sk1)))) :rule contraction :premises (t40))
% 0.20/0.52 (step t42 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.organisation_at_time A B)) (tptp.first_mover A) (tptp.efficient_producer A)))) (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (tptp.first_mover tptp.sk1) (tptp.efficient_producer tptp.sk1))) :rule implies :premises (t41))
% 0.20/0.52 (step t43 (cl (or (not (tptp.organisation_at_time tptp.sk1 tptp.sk2)) (tptp.first_mover tptp.sk1) (tptp.efficient_producer tptp.sk1))) :rule resolution :premises (t42 a7))
% 0.20/0.52 (step t44 (cl) :rule resolution :premises (t2 t24 t35 t43 a3))
% 0.20/0.52
% 0.20/0.53 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.Hsmt8XXKwk/cvc5---1.0.5_23637.smt2
% 0.20/0.53 % cvc5---1.0.5 exiting
% 0.20/0.53 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------