TSTP Solution File: LCL578+1 by cvc5-SAT---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5-SAT---1.0.5
% Problem : LCL578+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n013.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 : Fri Nov 24 04:17:04 EST 2023
% Result : CounterSatisfiable 1.21s 1.39s
% Output : FiniteModel 1.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL578+1 : TPTP v8.1.2. Released v3.3.0.
% 0.10/0.13 % Command : do_cvc5 %s %d
% 0.13/0.34 % Computer : n013.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 : Tue Nov 21 19:26:14 EST 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.48 %----Disproving FOF, CNF
% 1.21/1.39 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.xi8JdE859R/cvc5---1.0.5_15194.p...
% 1.21/1.39 ------- get file name : TPTP file name is LCL578+1
% 1.21/1.39 ------- cvc5-fnt : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_15194.smt2...
% 1.21/1.39 --- Run --finite-model-find at 30...
% 1.21/1.39 % SZS status CounterSatisfiable for LCL578+1
% 1.21/1.39 % SZS output start FiniteModel for LCL578+1
% 1.21/1.39 (
% 1.21/1.39 ; cardinality of $$unsorted is 3
% 1.21/1.39 ; rep: (as @$$unsorted_0 $$unsorted)
% 1.21/1.39 ; rep: (as @$$unsorted_1 $$unsorted)
% 1.21/1.39 ; rep: (as @$$unsorted_2 $$unsorted)
% 1.21/1.39 (define-fun tptp.op_or () Bool true)
% 1.21/1.39 (define-fun tptp.not (($x1 $$unsorted)) $$unsorted (ite (= (as @$$unsorted_1 $$unsorted) $x1) (as @$$unsorted_2 $$unsorted) (ite (= (as @$$unsorted_2 $$unsorted) $x1) (as @$$unsorted_1 $$unsorted) (as @$$unsorted_0 $$unsorted))))
% 1.21/1.39 (define-fun tptp.and (($x1 $$unsorted) ($x2 $$unsorted)) $$unsorted (ite (and (= (as @$$unsorted_1 $$unsorted) $x1) (= (as @$$unsorted_2 $$unsorted) $x2)) (as @$$unsorted_2 $$unsorted) (ite (and (= (as @$$unsorted_2 $$unsorted) $x1) (= (as @$$unsorted_0 $$unsorted) $x2)) (as @$$unsorted_2 $$unsorted) (ite (and (= (as @$$unsorted_0 $$unsorted) $x1) (= (as @$$unsorted_2 $$unsorted) $x2)) (as @$$unsorted_2 $$unsorted) (ite (and (= (as @$$unsorted_2 $$unsorted) $x1) (= (as @$$unsorted_2 $$unsorted) $x2)) (as @$$unsorted_2 $$unsorted) (ite (and (= (as @$$unsorted_2 $$unsorted) $x1) (= (as @$$unsorted_1 $$unsorted) $x2)) (as @$$unsorted_2 $$unsorted) (ite (and (= (as @$$unsorted_1 $$unsorted) $x1) (= (as @$$unsorted_1 $$unsorted) $x2)) (as @$$unsorted_1 $$unsorted) (as @$$unsorted_0 $$unsorted))))))))
% 1.21/1.39 (define-fun tptp.or (($x1 $$unsorted) ($x2 $$unsorted)) $$unsorted (ite (and (= (as @$$unsorted_2 $$unsorted) $x1) (= (as @$$unsorted_2 $$unsorted) $x2)) (as @$$unsorted_2 $$unsorted) (ite (and (= (as @$$unsorted_1 $$unsorted) $x1) (= (as @$$unsorted_0 $$unsorted) $x2)) (as @$$unsorted_1 $$unsorted) (ite (and (= (as @$$unsorted_0 $$unsorted) $x1) (= (as @$$unsorted_1 $$unsorted) $x2)) (as @$$unsorted_1 $$unsorted) (ite (and (= (as @$$unsorted_1 $$unsorted) $x1) (= (as @$$unsorted_1 $$unsorted) $x2)) (as @$$unsorted_1 $$unsorted) (ite (and (= (as @$$unsorted_1 $$unsorted) $x1) (= (as @$$unsorted_2 $$unsorted) $x2)) (as @$$unsorted_1 $$unsorted) (ite (and (= (as @$$unsorted_2 $$unsorted) $x1) (= (as @$$unsorted_1 $$unsorted) $x2)) (as @$$unsorted_1 $$unsorted) (as @$$unsorted_0 $$unsorted))))))))
% 1.21/1.39 (define-fun tptp.op_and () Bool false)
% 1.21/1.39 (define-fun tptp.op_implies_and () Bool false)
% 1.21/1.39 (define-fun tptp.implies (($x1 $$unsorted) ($x2 $$unsorted)) $$unsorted (ite (and (= (as @$$unsorted_0 $$unsorted) $x1) (= (as @$$unsorted_2 $$unsorted) $x2)) (as @$$unsorted_1 $$unsorted) (ite (and (= (as @$$unsorted_1 $$unsorted) $x1) (= (as @$$unsorted_0 $$unsorted) $x2)) (as @$$unsorted_1 $$unsorted) (ite (and (= (as @$$unsorted_1 $$unsorted) $x1) (= (as @$$unsorted_2 $$unsorted) $x2)) (as @$$unsorted_1 $$unsorted) (as @$$unsorted_0 $$unsorted)))))
% 1.21/1.39 (define-fun tptp.op_implies_or () Bool false)
% 1.21/1.39 (define-fun tptp.op_equiv () Bool true)
% 1.21/1.39 (define-fun tptp.equiv (($x1 $$unsorted) ($x2 $$unsorted)) $$unsorted (as @$$unsorted_0 $$unsorted))
% 1.21/1.39 (define-fun tptp.necessitation () Bool false)
% 1.21/1.39 (define-fun tptp.is_a_theorem (($x1 $$unsorted)) Bool (= (as @$$unsorted_1 $$unsorted) $x1))
% 1.21/1.39 (define-fun tptp.necessarily (($x1 $$unsorted)) $$unsorted (ite (= (as @$$unsorted_0 $$unsorted) $x1) (as @$$unsorted_1 $$unsorted) (ite (= (as @$$unsorted_2 $$unsorted) $x1) (as @$$unsorted_1 $$unsorted) (as @$$unsorted_0 $$unsorted))))
% 1.21/1.39 (define-fun tptp.modus_ponens_strict_implies () Bool true)
% 1.21/1.39 (define-fun tptp.strict_implies (($x1 $$unsorted) ($x2 $$unsorted)) $$unsorted (ite (and (= (as @$$unsorted_2 $$unsorted) $x1) (= (as @$$unsorted_2 $$unsorted) $x2)) (as @$$unsorted_1 $$unsorted) (ite (and (= (as @$$unsorted_2 $$unsorted) $x1) (= (as @$$unsorted_1 $$unsorted) $x2)) (as @$$unsorted_1 $$unsorted) (ite (and (= (as @$$unsorted_0 $$unsorted) $x1) (= (as @$$unsorted_0 $$unsorted) $x2)) (as @$$unsorted_1 $$unsorted) (ite (and (= (as @$$unsorted_2 $$unsorted) $x1) (= (as @$$unsorted_0 $$unsorted) $x2)) (as @$$unsorted_1 $$unsorted) (ite (and (= (as @$$unsorted_1 $$unsorted) $x1) (= (as @$$unsorted_1 $$unsorted) $x2)) (as @$$unsorted_1 $$unsorted) (ite (and (= (as @$$unsorted_0 $$unsorted) $x1) (= (as @$$unsorted_1 $$unsorted) $x2)) (as @$$unsorted_1 $$unsorted) (as @$$unsorted_0 $$unsorted))))))))
% 1.21/1.39 (define-fun tptp.adjunction () Bool true)
% 1.21/1.39 (define-fun tptp.substitution_strict_equiv () Bool true)
% 1.21/1.39 (define-fun tptp.strict_equiv (($x1 $$unsorted) ($x2 $$unsorted)) $$unsorted (ite (and (= (as @$$unsorted_1 $$unsorted) $x1) (= (as @$$unsorted_1 $$unsorted) $x2)) (as @$$unsorted_1 $$unsorted) (ite (and (= (as @$$unsorted_2 $$unsorted) $x1) (= (as @$$unsorted_2 $$unsorted) $x2)) (as @$$unsorted_1 $$unsorted) (ite (and (= (as @$$unsorted_0 $$unsorted) $x1) (= (as @$$unsorted_0 $$unsorted) $x2)) (as @$$unsorted_1 $$unsorted) (as @$$unsorted_0 $$unsorted)))))
% 1.21/1.39 (define-fun tptp.axiom_K () Bool false)
% 1.21/1.39 (define-fun tptp.axiom_M () Bool (forall ((X $$unsorted)) (tptp.is_a_theorem (tptp.implies (tptp.necessarily X) X))))
% 1.21/1.39 (define-fun tptp.axiom_4 () Bool (forall ((X $$unsorted)) (tptp.is_a_theorem (tptp.implies (tptp.necessarily X) (tptp.necessarily (tptp.necessarily X))))))
% 1.21/1.39 (define-fun tptp.axiom_B () Bool false)
% 1.21/1.39 (define-fun tptp.possibly (($x1 $$unsorted)) $$unsorted (ite (= (as @$$unsorted_0 $$unsorted) $x1) (as @$$unsorted_2 $$unsorted) (ite (= (as @$$unsorted_1 $$unsorted) $x1) (as @$$unsorted_2 $$unsorted) (as @$$unsorted_0 $$unsorted))))
% 1.21/1.39 (define-fun tptp.axiom_5 () Bool false)
% 1.21/1.39 (define-fun tptp.axiom_s1 () Bool false)
% 1.21/1.39 (define-fun tptp.axiom_s2 () Bool (forall ((P $$unsorted) (Q $$unsorted)) (tptp.is_a_theorem (tptp.strict_implies (tptp.possibly (tptp.and P Q)) (tptp.and (tptp.possibly P) (tptp.possibly Q))))))
% 1.21/1.39 (define-fun tptp.axiom_s3 () Bool (forall ((X $$unsorted) (Y $$unsorted)) (tptp.is_a_theorem (tptp.strict_implies (tptp.strict_implies X Y) (tptp.strict_implies (tptp.not (tptp.possibly Y)) (tptp.not (tptp.possibly X)))))))
% 1.21/1.39 (define-fun tptp.axiom_s4 () Bool (forall ((X $$unsorted)) (tptp.is_a_theorem (tptp.strict_implies (tptp.necessarily X) (tptp.necessarily (tptp.necessarily X))))))
% 1.21/1.39 (define-fun tptp.axiom_m1 () Bool true)
% 1.21/1.39 (define-fun tptp.axiom_m2 () Bool true)
% 1.21/1.39 (define-fun tptp.axiom_m3 () Bool true)
% 1.21/1.39 (define-fun tptp.axiom_m4 () Bool true)
% 1.21/1.39 (define-fun tptp.axiom_m5 () Bool true)
% 1.21/1.39 (define-fun tptp.axiom_m6 () Bool false)
% 1.21/1.39 (define-fun tptp.axiom_m7 () Bool (forall ((P $$unsorted) (Q $$unsorted)) (tptp.is_a_theorem (tptp.strict_implies (tptp.possibly (tptp.and P Q)) P))))
% 1.21/1.39 (define-fun tptp.axiom_m8 () Bool (forall ((P $$unsorted) (Q $$unsorted)) (tptp.is_a_theorem (tptp.strict_implies (tptp.strict_implies P Q) (tptp.strict_implies (tptp.possibly P) (tptp.possibly Q))))))
% 1.21/1.39 (define-fun tptp.axiom_m9 () Bool false)
% 1.21/1.39 (define-fun tptp.axiom_m10 () Bool true)
% 1.21/1.39 (define-fun tptp.op_possibly () Bool true)
% 1.21/1.39 (define-fun tptp.op_necessarily () Bool false)
% 1.21/1.39 (define-fun tptp.op_strict_implies () Bool true)
% 1.21/1.39 (define-fun tptp.op_strict_equiv () Bool true)
% 1.21/1.39 (define-fun tptp.op_implies () Bool true)
% 1.21/1.39 )
% 1.21/1.39 % SZS output end FiniteModel for LCL578+1
% 1.21/1.39 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------