TSTP Solution File: PLA006-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : PLA006-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %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 : 300s
% DateTime : Thu Aug 31 12:59:32 EDT 2023
% Result : Unsatisfiable 0.58s 0.78s
% Output : Proof 0.58s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PLA006-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.14 % Command : do_cvc5 %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 : 300
% 0.13/0.34 % DateTime : Sun Aug 27 06:10:40 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.48 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.TBSJ6fmjkI/cvc5---1.0.5_24473.p...
% 0.20/0.49 ------- get file name : TPTP file name is PLA006-1
% 0.20/0.49 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_24473.smt2...
% 0.20/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.58/0.78 % SZS status Unsatisfiable for PLA006-1
% 0.58/0.78 % SZS output start Proof for PLA006-1
% 0.58/0.78 (
% 0.58/0.78 (let ((_let_1 (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.c tptp.table) State))))) (let ((_let_2 (forall ((State $$unsorted)) (tptp.holds (tptp.clear tptp.table) State)))) (let ((_let_3 (tptp.holds tptp.empty tptp.s0))) (let ((_let_4 (tptp.holds (tptp.clear tptp.c) tptp.s0))) (let ((_let_5 (tptp.differ tptp.c tptp.table))) (let ((_let_6 (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.on X Y) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State)))))) (let ((_let_7 (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table)))))) (let ((_let_8 (tptp.do (tptp.pickup tptp.c) tptp.s0))) (let ((_let_9 (tptp.do (tptp.putdown tptp.c tptp.table) _let_8))) (let ((_let_10 (tptp.on tptp.c tptp.table))) (let ((_let_11 (tptp.holds _let_10 _let_9))) (let ((_let_12 (_let_1))) (let ((_let_13 (ASSUME :args _let_12))) (let ((_let_14 (tptp.clear tptp.table))) (let ((_let_15 (tptp.holds _let_14 _let_8))) (let ((_let_16 (not _let_15))) (let ((_let_17 (tptp.holds (tptp.holding tptp.c) _let_8))) (let ((_let_18 (not _let_17))) (let ((_let_19 (or _let_11 _let_18 _let_16))) (let ((_let_20 (_let_6))) (let ((_let_21 (ASSUME :args _let_20))) (let ((_let_22 (_let_2))) (let ((_let_23 (ASSUME :args _let_22))) (let ((_let_24 (not _let_5))) (let ((_let_25 (not _let_4))) (let ((_let_26 (not _let_3))) (let ((_let_27 (or _let_17 _let_26 _let_25 _let_24))) (let ((_let_28 (_let_7))) (let ((_let_29 (ASSUME :args _let_28))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_13 :args (_let_9 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.holds _let_10 State) false))))) :args _let_12)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_19)) :args ((or _let_18 _let_16 _let_11 (not _let_19)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_27)) :args ((or _let_24 _let_25 _let_26 _let_17 (not _let_27)))) (ASSUME :args (_let_5)) (ASSUME :args (_let_4)) (ASSUME :args (_let_3)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_29 :args (tptp.c tptp.s0 QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.holds (tptp.clear X) State) false))))) :args _let_28)) _let_29 :args (_let_27 false _let_7)) :args (_let_17 false _let_5 false _let_4 false _let_3 false _let_27)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_23 :args (_let_8 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.holds _let_14 State) true))))) :args _let_22)) _let_23 :args (_let_15 false _let_2)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_21 :args (tptp.c tptp.table _let_8 QUANTIFIERS_INST_E_MATCHING ((tptp.do (tptp.putdown X Y) State)))) :args _let_20)) _let_21 :args (_let_19 false _let_6)) :args (_let_11 false _let_17 false _let_15 false _let_19)) _let_13 :args (false false _let_11 false _let_1)) :args ((forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.and X Y) State) (not (tptp.holds X State)) (not (tptp.holds Y State)))) _let_7 (forall ((Y $$unsorted) (X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Y) (tptp.do (tptp.pickup X) State)) (not (tptp.holds (tptp.on X Y) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.holds tptp.empty State)))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (State $$unsorted)) (let ((_let_1 (tptp.on X Y))) (or (tptp.holds _let_1 (tptp.do (tptp.pickup Z) State)) (not (tptp.holds _let_1 State)) (not (tptp.differ X Z))))) (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (let ((_let_1 (tptp.clear X))) (or (tptp.holds _let_1 (tptp.do (tptp.pickup Z) State)) (not (tptp.holds _let_1 State)) (not (tptp.differ X Z))))) (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State)))) _let_6 (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State)))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted) (State $$unsorted)) (let ((_let_1 (tptp.on X Y))) (or (tptp.holds _let_1 (tptp.do (tptp.putdown Z W) State)) (not (tptp.holds _let_1 State))))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (let ((_let_1 (tptp.clear Z))) (or (tptp.holds _let_1 (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds _let_1 State)) (not (tptp.differ Z Y))))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X)))) (tptp.differ tptp.a tptp.b) (tptp.differ tptp.a tptp.c) (tptp.differ tptp.a tptp.d) (tptp.differ tptp.a tptp.table) (tptp.differ tptp.b tptp.c) (tptp.differ tptp.b tptp.d) (tptp.differ tptp.b tptp.table) (tptp.differ tptp.c tptp.d) _let_5 (tptp.differ tptp.d tptp.table) (tptp.holds (tptp.on tptp.a tptp.table) tptp.s0) (tptp.holds (tptp.on tptp.b tptp.table) tptp.s0) (tptp.holds (tptp.on tptp.c tptp.d) tptp.s0) (tptp.holds (tptp.on tptp.d tptp.table) tptp.s0) (tptp.holds (tptp.clear tptp.a) tptp.s0) (tptp.holds (tptp.clear tptp.b) tptp.s0) _let_4 _let_3 _let_2 _let_1))))))))))))))))))))))))))))))))
% 0.58/0.78 )
% 0.58/0.78 % SZS output end Proof for PLA006-1
% 0.58/0.79 % cvc5---1.0.5 exiting
% 0.58/0.79 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------