↑ Up

cvc5-SAT---1.3.4.SAT-Mod.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5-SAT---1.3.4
% Problem  : LCL697^1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n001.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 11:25:43 AM UTC 2026

% Result   : Satisfiable 0.20s 0.49s
% Output   : Model 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL697^1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37  % Computer : n001.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sat Sep  5 19:16:32 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.44  %----Disproving TH0
% 0.10/0.45  --- Run --mbqi --mbqi-enum --mbqi-enum-choice-grammar --mbqi-enum-global-syms-grammar --sygus-grammar-ho-partial --no-cegqi --no-sygus-inst at 72s...
% 0.20/0.49  % SZS status Satisfiable
% 0.20/0.49  % SZS output start Model
% 0.20/0.49  (
% 0.20/0.49  ; cardinality of $$unsorted is 1
% 0.20/0.49  ; rep: (as @$$unsorted_0 $$unsorted)
% 0.20/0.49  (define-fun tptp.irel ((BOUND_VARIABLE_1001 $$unsorted) (BOUND_VARIABLE_1003 $$unsorted)) Bool (and (= (as @$$unsorted_0 $$unsorted) BOUND_VARIABLE_1001) (= (as @$$unsorted_0 $$unsorted) BOUND_VARIABLE_1003)))
% 0.20/0.49  (define-fun tptp.mnot ((X (-> $$unsorted Bool)) (U $$unsorted)) Bool (not (@ X U)))
% 0.20/0.49  (define-fun tptp.mor ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool)) (U $$unsorted)) Bool (or (@ X U) (@ Y U)))
% 0.20/0.49  (define-fun tptp.mand ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool)) (U $$unsorted)) Bool (and (@ X U) (@ Y U)))
% 0.20/0.49  (define-fun tptp.mimplies ((U (-> $$unsorted Bool)) (V (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) Bool (or (not (@ U __flatten_var_0)) (@ V __flatten_var_0)))
% 0.20/0.49  (define-fun tptp.mbox_s4 ((P (-> $$unsorted Bool)) (X $$unsorted)) Bool (forall ((Y $$unsorted)) (or (not (tptp.irel X Y)) (P Y))))
% 0.20/0.49  (define-fun tptp.iatom ((P (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) Bool (forall ((Y $$unsorted)) (or (not (tptp.irel __flatten_var_0 Y)) (P Y))))
% 0.20/0.49  (define-fun tptp.inot ((P (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) Bool (forall ((Y $$unsorted)) (or (not (tptp.irel __flatten_var_0 Y)) (not (P Y)))))
% 0.20/0.49  (define-fun tptp.itrue ((BOUND_VARIABLE_818 $$unsorted)) Bool true)
% 0.20/0.49  (define-fun tptp.ifalse ((__flatten_var_0 $$unsorted)) Bool (forall ((Y $$unsorted)) (not (tptp.irel __flatten_var_0 Y))))
% 0.20/0.49  (define-fun tptp.iand ((P (-> $$unsorted Bool)) (Q (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) Bool (and (@ P __flatten_var_0) (@ Q __flatten_var_0)))
% 0.20/0.49  (define-fun tptp.ior ((P (-> $$unsorted Bool)) (Q (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) Bool (or (@ P __flatten_var_0) (@ Q __flatten_var_0)))
% 0.20/0.49  (define-fun tptp.iimplies ((P (-> $$unsorted Bool)) (Q (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) Bool (forall ((Y $$unsorted)) (or (not (tptp.irel __flatten_var_0 Y)) (not (P Y)) (Q Y))))
% 0.20/0.49  (define-fun tptp.iimplied ((P (-> $$unsorted Bool)) (Q (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) Bool (forall ((Y $$unsorted)) (or (not (tptp.irel __flatten_var_0 Y)) (not (Q Y)) (P Y))))
% 0.20/0.49  (define-fun tptp.iequiv ((P (-> $$unsorted Bool)) (Q (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) Bool (and (forall ((Y $$unsorted)) (or (not (tptp.irel __flatten_var_0 Y)) (not (P Y)) (Q Y))) (forall ((Y $$unsorted)) (or (not (tptp.irel __flatten_var_0 Y)) (not (Q Y)) (P Y)))))
% 0.20/0.49  (define-fun tptp.ixor ((P (-> $$unsorted Bool)) (Q (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) Bool (not (and (forall ((Y $$unsorted)) (or (not (tptp.irel __flatten_var_0 Y)) (not (P Y)) (Q Y))) (forall ((Y $$unsorted)) (or (not (tptp.irel __flatten_var_0 Y)) (not (Q Y)) (P Y))))))
% 0.20/0.49  (define-fun tptp.ivalid ((Phi (-> $$unsorted Bool))) Bool (forall ((W $$unsorted)) (Phi W)))
% 0.20/0.49  (define-fun tptp.isatisfiable ((Phi (-> $$unsorted Bool))) Bool (not (forall ((W $$unsorted)) (not (Phi W)))))
% 0.20/0.49  (define-fun tptp.icountersatisfiable ((Phi (-> $$unsorted Bool))) Bool (not (forall ((W $$unsorted)) (Phi W))))
% 0.20/0.49  (define-fun tptp.iinvalid ((Phi (-> $$unsorted Bool))) Bool (forall ((W $$unsorted)) (not (Phi W))))
% 0.20/0.49  )
% 0.20/0.49  % SZS output end Model
% 0.20/0.50  % cvc5 exiting
%------------------------------------------------------------------------------