TSTP Solution File: LAT387+1 by Crossbow---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Crossbow---0.1
% Problem : LAT387+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_Crossbow---0.1 %s
% Computer : n017.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 : 600s
% DateTime : Sun Jul 17 03:55:32 EDT 2022
% Result : CounterSatisfiable 5.21s 5.40s
% Output : FiniteModel 5.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LAT387+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : do_Crossbow---0.1 %s
% 0.13/0.34 % Computer : n017.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 : 600
% 0.13/0.34 % DateTime : Wed Jun 29 20:15:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34 /export/starexec/sandbox/solver/bin
% 0.13/0.34 crossbow.opt
% 0.13/0.34 do_Crossbow---0.1
% 0.13/0.34 eprover
% 0.13/0.34 runsolver
% 0.13/0.34 starexec_run_Crossbow---0.1
% 5.21/5.40 % SZS status CounterSatisfiable for theBenchmark.p
% 5.21/5.40 % SZS output start FiniteModel for theBenchmark.p
% 5.21/5.40 % domain size: 2
% 5.21/5.40 fof(interp, fi_domain, ![X] : (X = 0 | X = 1)).
% 5.21/5.40 fof(interp, fi_predicates, aCompleteLattice0(0) & aCompleteLattice0(1)).
% 5.21/5.40 fof(interp, fi_predicates, aElement0(0) & aElement0(1)).
% 5.21/5.40 fof(interp, fi_predicates, aElementOf0(0, 0) & aElementOf0(0, 1) &
% 5.21/5.40 aElementOf0(1, 0) &
% 5.21/5.40 ~aElementOf0(1, 1)).
% 5.21/5.40 fof(interp, fi_predicates, aFixedPointOf0(0, 0) & aFixedPointOf0(0, 1) &
% 5.21/5.40 ~aFixedPointOf0(1, 0) &
% 5.21/5.40 ~aFixedPointOf0(1, 1)).
% 5.21/5.40 fof(interp, fi_predicates, aFunction0(0) & aFunction0(1)).
% 5.21/5.40 fof(interp, fi_predicates, aInfimumOfIn0(0, 0, 0) & aInfimumOfIn0(0, 0, 1) &
% 5.21/5.40 aInfimumOfIn0(0, 1, 0) &
% 5.21/5.40 aInfimumOfIn0(0, 1, 1) &
% 5.21/5.40 ~aInfimumOfIn0(1, 0, 0) &
% 5.21/5.40 ~aInfimumOfIn0(1, 0, 1) &
% 5.21/5.40 ~aInfimumOfIn0(1, 1, 0) &
% 5.21/5.40 ~aInfimumOfIn0(1, 1, 1)).
% 5.21/5.40 fof(interp, fi_predicates, aLowerBoundOfIn0(0, 0, 0) & aLowerBoundOfIn0(0, 0, 1) &
% 5.21/5.40 aLowerBoundOfIn0(0, 1, 0) &
% 5.21/5.40 aLowerBoundOfIn0(0, 1, 1) &
% 5.21/5.40 ~aLowerBoundOfIn0(1, 0, 0) &
% 5.21/5.40 ~aLowerBoundOfIn0(1, 0, 1) &
% 5.21/5.40 ~aLowerBoundOfIn0(1, 1, 0) &
% 5.21/5.40 ~aLowerBoundOfIn0(1, 1, 1)).
% 5.21/5.40 fof(interp, fi_predicates, aSet0(0) & aSet0(1)).
% 5.21/5.40 fof(interp, fi_predicates, aSubsetOf0(0, 0) & ~aSubsetOf0(0, 1) &
% 5.21/5.40 aSubsetOf0(1, 0) &
% 5.21/5.40 aSubsetOf0(1, 1)).
% 5.21/5.40 fof(interp, fi_predicates, ~aSupremumOfIn0(0, 0, 0) & ~aSupremumOfIn0(0, 0, 1) &
% 5.21/5.40 aSupremumOfIn0(0, 1, 0) &
% 5.21/5.40 aSupremumOfIn0(0, 1, 1) &
% 5.21/5.40 aSupremumOfIn0(1, 0, 0) &
% 5.21/5.40 ~aSupremumOfIn0(1, 0, 1) &
% 5.21/5.40 ~aSupremumOfIn0(1, 1, 0) &
% 5.21/5.40 ~aSupremumOfIn0(1, 1, 1)).
% 5.21/5.40 fof(interp, fi_predicates, ~aUpperBoundOfIn0(0, 0, 0) &
% 5.21/5.40 aUpperBoundOfIn0(0, 0, 1) &
% 5.21/5.40 aUpperBoundOfIn0(0, 1, 0) &
% 5.21/5.40 aUpperBoundOfIn0(0, 1, 1) &
% 5.21/5.40 aUpperBoundOfIn0(1, 0, 0) &
% 5.21/5.40 ~aUpperBoundOfIn0(1, 0, 1) &
% 5.21/5.40 aUpperBoundOfIn0(1, 1, 0) &
% 5.21/5.40 ~aUpperBoundOfIn0(1, 1, 1)).
% 5.21/5.40 fof(interp, fi_functors, cS1142(0) = 0 & cS1142(1) = 0).
% 5.21/5.40 fof(interp, fi_functors, cS1241(0, 0, 0) = 0 & cS1241(0, 0, 1) = 0 &
% 5.21/5.40 cS1241(0, 1, 0) = 0 &
% 5.21/5.40 cS1241(0, 1, 1) = 0 &
% 5.21/5.40 cS1241(1, 0, 0) = 0 &
% 5.21/5.40 cS1241(1, 0, 1) = 0 &
% 5.21/5.40 cS1241(1, 1, 0) = 0 &
% 5.21/5.40 cS1241(1, 1, 1) = 0).
% 5.21/5.40 fof(interp, fi_functors, esk10_1(0) = 0 & esk10_1(1) = 0).
% 5.21/5.40 fof(interp, fi_functors, esk11_1(0) = 0 & esk11_1(1) = 0).
% 5.21/5.40 fof(interp, fi_functors, esk1_1(0) = 0 & esk1_1(1) = 0).
% 5.21/5.40 fof(interp, fi_functors, esk2_2(0, 0) = 0 & esk2_2(0, 1) = 0 & esk2_2(1, 0) = 1 &
% 5.21/5.40 esk2_2(1, 1) = 1).
% 5.21/5.40 fof(interp, fi_functors, esk3_3(0, 0, 0) = 0 & esk3_3(0, 0, 1) = 0 &
% 5.21/5.40 esk3_3(0, 1, 0) = 0 &
% 5.21/5.40 esk3_3(0, 1, 1) = 0 &
% 5.21/5.40 esk3_3(1, 0, 0) = 0 &
% 5.21/5.40 esk3_3(1, 0, 1) = 0 &
% 5.21/5.40 esk3_3(1, 1, 0) = 0 &
% 5.21/5.40 esk3_3(1, 1, 1) = 0).
% 5.21/5.40 fof(interp, fi_functors, esk4_3(0, 0, 0) = 1 & esk4_3(0, 0, 1) = 0 &
% 5.21/5.40 esk4_3(0, 1, 0) = 0 &
% 5.21/5.40 esk4_3(0, 1, 1) = 0 &
% 5.21/5.40 esk4_3(1, 0, 0) = 0 &
% 5.21/5.40 esk4_3(1, 0, 1) = 0 &
% 5.21/5.40 esk4_3(1, 1, 0) = 0 &
% 5.21/5.40 esk4_3(1, 1, 1) = 0).
% 5.21/5.40 fof(interp, fi_functors, esk5_3(0, 0, 0) = 0 & esk5_3(0, 0, 1) = 0 &
% 5.21/5.40 esk5_3(0, 1, 0) = 0 &
% 5.21/5.40 esk5_3(0, 1, 1) = 0 &
% 5.21/5.40 esk5_3(1, 0, 0) = 0 &
% 5.21/5.40 esk5_3(1, 0, 1) = 0 &
% 5.21/5.40 esk5_3(1, 1, 0) = 0 &
% 5.21/5.40 esk5_3(1, 1, 1) = 0).
% 5.21/5.40 fof(interp, fi_functors, esk6_3(0, 0, 0) = 0 & esk6_3(0, 0, 1) = 0 &
% 5.21/5.40 esk6_3(0, 1, 0) = 0 &
% 5.21/5.40 esk6_3(0, 1, 1) = 0 &
% 5.21/5.40 esk6_3(1, 0, 0) = 0 &
% 5.21/5.40 esk6_3(1, 0, 1) = 0 &
% 5.21/5.40 esk6_3(1, 1, 0) = 0 &
% 5.21/5.40 esk6_3(1, 1, 1) = 0).
% 5.21/5.40 fof(interp, fi_functors, esk7_2(0, 0) = 0 & esk7_2(0, 1) = 0 & esk7_2(1, 0) = 0 &
% 5.21/5.40 esk7_2(1, 1) = 0).
% 5.21/5.40 fof(interp, fi_functors, esk8_2(0, 0) = 1 & esk8_2(0, 1) = 0 & esk8_2(1, 0) = 0 &
% 5.21/5.40 esk8_2(1, 1) = 0).
% 5.21/5.40 fof(interp, fi_functors, esk9_1(0) = 0 & esk9_1(1) = 0).
% 5.21/5.40 fof(interp, fi_predicates, ~isEmpty0(0) & ~isEmpty0(1)).
% 5.21/5.40 fof(interp, fi_predicates, isMonotone0(0) & isMonotone0(1)).
% 5.21/5.40 fof(interp, fi_predicates, ~isOn0(0, 0) & isOn0(0, 1) & ~isOn0(1, 0) &
% 5.21/5.40 isOn0(1, 1)).
% 5.21/5.40 fof(interp, fi_functors, sdtlpdtrp0(0, 0) = 0 & sdtlpdtrp0(0, 1) = 0 &
% 5.21/5.40 sdtlpdtrp0(1, 0) = 0 &
% 5.21/5.40 sdtlpdtrp0(1, 1) = 0).
% 5.21/5.40 fof(interp, fi_predicates, sdtlseqdt0(0, 0) & sdtlseqdt0(0, 1) &
% 5.21/5.40 ~sdtlseqdt0(1, 0) &
% 5.21/5.40 sdtlseqdt0(1, 1)).
% 5.21/5.40 fof(interp, fi_functors, szDzozmdt0(0) = 1 & szDzozmdt0(1) = 1).
% 5.21/5.40 fof(interp, fi_functors, szRzazndt0(0) = 1 & szRzazndt0(1) = 1).
% 5.21/5.40 fof(interp, fi_functors, xP = 0).
% 5.21/5.40 fof(interp, fi_functors, xS = 0).
% 5.21/5.40 fof(interp, fi_functors, xT = 0).
% 5.21/5.40 fof(interp, fi_functors, xU = 1).
% 5.21/5.40 fof(interp, fi_functors, xf = 0).
% 5.21/5.40 fof(interp, fi_functors, xp = 0).
% 5.21/5.40 % SZS output end FiniteModel for theBenchmark.p
% 5.21/5.40 % 0 lemma(s) from E
% 5.21/5.40 % 25 pred(s)
% 5.21/5.40 % 23 func(s)
% 5.21/5.40 % 3 sort(s)
% 5.21/5.40 % 71 clause(s)
% 5.21/5.40 % Instantiating 1 (5025 ms)
% 5.21/5.40 % Solving (5026 ms)
% 5.21/5.40 % Instantiating 2 (5026 ms)
% 5.21/5.40 % Solving (5026 ms)
% 5.21/5.40 %
% 5.21/5.40 % 1 model found (5028 ms)
%------------------------------------------------------------------------------